On the asymptotic structure of sparse triangle free graphs

DOI10.1002/(SICI)1097-0118(199602)21:2%3C137::AID-JGT3%3E3.0.CO;2-SzbMATH Open0856.05037OpenAlexW1976442532MaRDI QIDQ4865522FDOQ4865522

Authors: 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%3C137::aid-jgt3%3E3.0.co;2-s

Recommendations

• For which densities are random triangle-free graphs almost surely bipartite?
• On the Evolution of Triangle-Free Graphs
• On the structure of clique-free graphs
• On triangle-free random graphs
• Triangle-free subgraphs of random graphs

zbMATH Keywords

chromatic numbertriangle-free graphsopen question

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (15)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Title not available (Why is that?)
• On the structure of clique-free graphs
• On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Title not available (Why is that?)
• On the typical structure of graphs not containing a fixed vertex-critical subgraph
• On the probability of nonexistence in binomial subsets
• The probability of non-existence of a subgraph in a moderately sparse random graph
• On the Evolution of Triangle-Free Graphs
• Sparse halves in dense triangle-free graphs
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• Triangle-free graphs with large chromatic numbers
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
• Counting sum-free sets in abelian groups

This page was built for publication: On the asymptotic structure of sparse triangle free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865522)