On the asymptotic structure of sparse triangle free graphs
From MaRDI portal
Publication:4865522
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199602)21:2<137::AID-JGT3>3.0.CO;2-S" /><137::AID-JGT3>3.0.CO;2-S 10.1002/(SICI)1097-0118(199602)21:2<137::AID-JGT3>3.0.CO;2-SzbMath0856.05037OpenAlexW1976442532MaRDI QIDQ4865522
Hans Jürgen Prömel, Angelika Steger
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<137::aid-jgt3>3.0.co;2-s
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ On the probability of nonexistence in binomial subsets ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Counting sum-free sets in abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
This page was built for publication: On the asymptotic structure of sparse triangle free graphs
