14 search results - page 1 / 3 » Co-degree density of hypergraphs |
169
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
129
click to vote
JCT
2007
15 years 6 months ago
2007
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
132
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
123
click to vote
JCT
2002
15 years 6 months ago
2002
Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung a...