Random graphs, random triangle-free graphs, and random partial orders
From MaRDI portal
A nice and accessible introduction to an aspect of random graph theory: given properties \(P\) and \(Q\), what is the probability that a random graph satisfying \(P\) also satisfies \(Q\)? The paper presents a selection of results on random triangle-free graphs, the clique and chromatic numbers of random graphs, and on random partial orders, most of them with proofs using the first and second moment methods. For the entire collection see [Zbl 0978.00022].
Recommendations
Cited in
(11)- On retracts of the random graph and their natural order
- For which densities are random triangle-free graphs almost surely bipartite?
- Sandwiching random graphs: universality between random graph models
- Random cyclic triangle-free graphs of prime order
- On the triangle space of a random graph
- scientific article; zbMATH DE number 845673 (Why is no real title available?)
- scientific article; zbMATH DE number 850234 (Why is no real title available?)
- Linear orderings of random geometric graphs
- Non‐orderability of random triangular groups by using random 3CNF formulas
- On the evolution of structure in triangle-free graphs
- On the chromatic number of random triangle-free graphs
This page was built for publication: Random graphs, random triangle-free graphs, and random partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542180)