The maximum size of hypergraphs without generalized 4-cycles

DOI10.1016/J.JCTA.2008.09.002MaRDI QIDQ1024366zbMATH OpenOpenAlexFDO

Authors Oleg Pikhurko, J. Verstraëte

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

generalized 4-cycleTurán function

Mathematics Subject Classification ID

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

Recommendations

• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• On hypergraphs of girth five
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Covering non-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3646948 (Why is no real title available?)
• scientific article; zbMATH DE number 89768 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• A Balanced Incomplete Block Design
• A hypergraph extension of the bipartite Turán problem
• Graphs without four-cycles
• Graphs without quadrilaterals
• Hypergraphs in which all disjoint pairs have distinct unions
• Minimal paths and cycles in set systems
• On Graphs that do not Contain a Thomsen Graph
• On the number of edges of quadrilateral-free graphs
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• Structure and stability of triangle-free set systems
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(18)

• Unavoidable hypergraphs
• On the \((6,4)\)-problem of Brown, Erdős, and Sós
• Extremal Problems for Hypergraph Blowups of Trees
• Regular subgraphs of uniform hypergraphs
• The largest minimum codegree of a 3-graph without a generalized 4-cycle
• A note on the maximum size of Berge-\( C_4\)-free hypergraphs
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• Two-regular subgraphs of hypergraphs
• Finding the shortest path for a hypergraph
• Covering non-uniform 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
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• On hypergraphs of girth five

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)