The maximum size of hypergraphs without generalized 4-cycles

DOI10.1016/j.jcta.2008.09.002zbMath1213.05188OpenAlexW2103078247MaRDI QIDQ1024366

Oleg Pikhurko, Jacques Verstraete

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

zbMATH Keywords

Turán functiongeneralized 4-cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

Regular subgraphs of uniform hypergraphs ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ New bounds for a hypergraph bipartite Turán problem ⋮ Turán problems and shadows. I: Paths and cycles ⋮ The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle ⋮ Relative Turán numbers for hypergraph cycles ⋮ Two-regular subgraphs of hypergraphs ⋮ Finding the shortest path for a Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs in which all disjoint pairs have distinct unions
• A hypergraph extension of the bipartite Turán problem
• Graphs without quadrilaterals
• On the number of edges of quadrilateral-free graphs
• Minimal paths and cycles in set systems
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• The Existence and Construction of Balanced Incomplete Block Designs
• Structure and stability of triangle-free set systems
• Graphs without four-cycles
• A Balanced Incomplete Block Design
• On Graphs that do not Contain a Thomsen Graph