The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle

DOI10.1017/S0963548312000430zbMath1257.05107MaRDI QIDQ4903265

Edward Marchant

Publication date: 21 January 2013

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

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)

Cites Work

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

This page was built for publication: The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle