The number of the maximal triangle-free graphs
type: Item
instance of: scholarly article
title: The number of the maximal triangle-free graphs
zbMATH Open document ID: 1302.05087
author: József Balogh
author: Šárka Petříčková
published in: Bulletin of the London Mathematical Society
publication date: 2014-10-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1409.8123
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6355598
zbMATH Keywords: maximal triangle-free graphs
describes a project that uses: MathOverflow
MaRDI profile type: Publication
OpenAlex ID: W2136893990
arXiv ID: 1409.8123
cites work: The number of maximal sum-free subsets of integers
cites work: Independent sets in hypergraphs
cites work: The typical structure of sparse \(K_{r+1}\)-free graphs
cites work: Supersaturated graphs and hypergraphs
cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs
cites work: For which densities are random triangle-free graphs almost surely bipartite?
cites work: Q4175585
cites work: Hypergraph containers
cites work: Bounds on the number of maximal sum-free sets
DOI: 10.1112/BLMS/BDU059
description: scientific article; zbMATH DE number 6355598