The largest minimum codegree of a 3-graph without a generalized 4-cycle

DOI10.1017/S0963548312000430MaRDI QIDQ4903265zbMATH OpenFDO

Authors Edward Marchant

Publication date 21 January 2013

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548312000430

zbMATH Keywords

maximum number of edges in a graph with no 4-cycle

Mathematics Subject Classification ID

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

Recommendations

• The maximum size of hypergraphs without generalized 4-cycles
• scientific article; zbMATH DE number 841612
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs

Cites work

• A Balanced Incomplete Block Design
• Graphs without quadrilaterals
• Hypergraphs in which all disjoint pairs have distinct unions
• The Existence and Construction of Balanced Incomplete Block Designs
• The maximum size of hypergraphs without generalized 4-cycles

Cited in

(2)

• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Crowns in linear \(3\)-graphs of minimum degree \(4\)

This page was built for publication: The largest minimum codegree of a 3-graph without a generalized 4-cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903265)