The number of the maximal triangle-free graphs

DOI10.1112/blms/bdu059zbMath1302.05087arXiv1409.8123OpenAlexW2136893990MaRDI QIDQ2922865

Sarka Petrickova, József Balogh

Publication date: 15 October 2014

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.8123

zbMATH Keywords

maximal triangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ A sharp bound on the number of maximal sum-free sets ⋮ On solution-free sets of integers ⋮ The number of maximal sum-free subsets of integers ⋮ Maximal independent sets in clique-free graphs ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Enumerating solution-free sets in the integers ⋮ Counting Gallai 3-colorings of complete graphs ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Hypergraph containers
• Supersaturated graphs and hypergraphs
• Bounds on the number of maximal sum-free sets
• For which densities are random triangle-free graphs almost surely bipartite?
• The typical structure of sparse $K_{r+1}$-free graphs
• The number of maximal sum-free subsets of integers
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Independent sets in hypergraphs

This page was built for publication: The number of the maximal triangle-free graphs