The maximum size of hypergraphs without generalized 4-cycles

DOI10.1016/J.JCTA.2008.09.002zbMATH Open1213.05188OpenAlexW2103078247MaRDI QIDQ1024366FDOQ1024366

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

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

zbMATH Keywords

generalized 4-cycleTurán function

Mathematics Subject Classification ID

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

Cites Work

• On Graphs that do not Contain a Thomsen Graph
• Hypergraphs in which all disjoint pairs have distinct unions
• Title not available (Why is that?)
• The Existence and Construction of Balanced Incomplete Block Designs
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Structure and stability of triangle-free set systems
• Title not available (Why is that?)
• A Balanced Incomplete Block Design

Cited In (15)

• Finding the shortest path for a Hypergraph
• Extremal Problems for Hypergraph Blowups of Trees
• The largest minimum codegree of a 3-graph without a generalized 4-cycle
• Regular subgraphs of uniform 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
• 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)