Sciweavers

12 search results - page 1 / 3
» The Generalization of Dirac's Theorem for Hypergraphs
Sort
View
5
Voted
MFCS
2005
Springer
13 years 8 months ago
The Generalization of Dirac's Theorem for Hypergraphs
Endre Szemerédi, Andrzej Rucinski, Vojtech ...
APAL
2011
12 years 9 months ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
DAM
1998
85views more  DAM 1998»
13 years 2 months ago
Separability Generalizes Dirac's Theorem
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
Anne Berry, Jean Paul Bordat
JCT
2008
120views more  JCT 2008»
13 years 2 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
LION
2007
Springer
138views Optimization» more  LION 2007»
13 years 8 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo