A Harary-Sachs theorem for hypergraphs
نویسندگان
چکیده
We generalize the Harary-Sachs theorem to k-uniform hypergraphs: codegree-d coefficient of characteristic polynomial a uniform hypergraph H can be expressed as weighted sum subgraph counts over certain multi-hypergraphs with d edges. include detailed description aforementioned and formula for their corresponding weights.
منابع مشابه
Toward a Hajnal-Szemerédi theorem for hypergraphs
Let H be a triple system with maximum degree d > 1 and let r > 107 √ d log d. Then H has a proper vertex coloring with r colors such that any two color classes differ in size by at most one. The bound on r is sharp in order of magnitude apart from the logarithmic factors. Moreover, such an r-coloring can be found via a randomized algorithm whose expected running time is polynomial in the number...
متن کاملMantel's theorem for random hypergraphs
A cornerstone result in extremal graph theory is Mantel’s Theorem, which states that every maximum triangle-free subgraph of Kn is bipartite. A sparse version of Mantel’s Theorem is that, for sufficiently large p, every maximum triangle-free subgraph of G(n, p) is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for p > K √ log n/n for some constant K, and apart from the value of the co...
متن کاملA 2-Isomorphism Theorem for Hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملThe Tree-Width Compactness Theorem for Hypergraphs
A hypergraph H has tree-width k (a notion introduced by Robertson and Seymour) if k is the least integer such that H admits a tree-decomposition of tree-width k. We prove a compactness theorem for this notion, that is, if every finite subhypergraph of H has tree-width < k, then H itself has tree-width < k. This result will be used in a later paper on well-quasi-ordering infinite graphs.
متن کاملThe Generalization of Dirac's Theorem for Hypergraphs
A substantial amount of research in graph theory continues to concentrate on the existence of hamiltonian cycles and perfect matchings. A classic theorem of Dirac states that a sufficient condition for an n-vertex graph to be hamiltonian, and thus, for n even, to have a perfect matching, is that the minimum degree is at least n/2. Moreover, there are obvious counterexamples showing that this is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.01.002