The maximum size of hypergraphs without generalized 4-cycles
From MaRDI portal
Publication:1024366
DOI10.1016/J.JCTA.2008.09.002zbMATH Open1213.05188OpenAlexW2103078247MaRDI QIDQ1024366FDOQ1024366
Publication date: 17 June 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2008.09.002
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+function&go=Go Tur��n function]generalized 4-cycle
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Graphs that do not Contain a Thomsen Graph
- Hypergraphs in which all disjoint pairs have distinct unions
- The Existence and Construction of Balanced Incomplete Block Designs
- Minimal paths and cycles in set systems
- Graphs without quadrilaterals
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- On the number of edges of quadrilateral-free graphs
- A hypergraph extension of the bipartite Turán problem
- Graphs without four-cycles
- Structure and stability of triangle-free set systems
- A Balanced Incomplete Block Design
Cited In (10)
- Finding the shortest path for a Hypergraph
- Extremal Problems for Hypergraph Blowups of Trees
- Regular subgraphs of uniform hypergraphs
- Two-regular subgraphs of hypergraphs
- Relative Turán numbers for hypergraph cycles
- New bounds for a hypergraph bipartite Turán problem
- Two-regular subgraphs of odd-uniform hypergraphs
- Turán problems and shadows. I: Paths and cycles
- Finding a minimal spanning hypertree of a weighted hypergraph
- The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle
This page was built for publication: The maximum size of hypergraphs without generalized 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024366)
