Kalai's conjecture in \(r\)-partite \(r\)-graphs
From MaRDI portal
Publication:6181994
DOI10.1016/j.ejc.2023.103827arXiv1912.11421OpenAlexW4387342413MaRDI QIDQ6181994
Publication date: 23 January 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.11421
Trees (05C05) Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Tight cycles and regular slices in dense hypergraphs
- On a packing and covering problem
- Exact solution of some Turán-type problems
- A note on traces of set families
- A variation of the Erdős-Sós conjecture in bipartite graphs
- Tree containment and degree conditions
- Hypergraph cuts above the average
- An extremal problem for paths in bipartite graphs
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk
- On coloring graphs to maximize the proportion of multicolored k-edges
- Some Extremal Properties of Bipartite Subgraphs
- MaxCut in ${\bm H)$-Free Graphs
This page was built for publication: Kalai's conjecture in \(r\)-partite \(r\)-graphs