For which densities are random triangle-free graphs almost surely bipartite?

DOI10.1007/s00493-003-0016-1zbMath1047.05040OpenAlexW2023104754MaRDI QIDQ1878594

Hans Jürgen Prömel, Deryk Osthus, Anusch Taraz

Publication date: 7 September 2004

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-003-0016-1

zbMATH Keywords

random graphsregularity lemmatriangle-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16)

Related Items

Extremal subgraphs of random graphs ⋮ Arcs in \(\mathbb{F}_q^2\) ⋮ THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph ⋮ The number of the maximal triangle-free graphs ⋮ On the probability of nonexistence in binomial subsets ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Forbidding induced even cycles in a graph: typical structure and counting ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ The typical structure of graphs with no large cliques ⋮ Counting sum-free sets in abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Independent sets in hypergraphs