Random perfect graphs
From MaRDI portal
Publication:4625032
DOI10.1002/rsa.20770zbMath1405.05165arXiv1604.00890OpenAlexW2963220137MaRDI QIDQ4625032
Nikola Yolov, Colin J. H. McDiarmid
Publication date: 20 February 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.00890
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of almost all graphs in a hereditary property
- Perfect graphs of arbitrarily large clique-chromatic number
- Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
- Edge-colouring random graphs
- Two-colouring all two-element maximal antichains
- A constructive proof of Vizing's theorem
- On the chromatic index of almost all graphs
- Random set partitions: Asymptotics of subset counts
- Recognition of unipolar and generalised split graphs
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Perfect Graphs of Fixed Density: Counting and Homogeneous Sets
- Excluding induced subgraphs: Critical graphs
- Almost all Berge Graphs are Perfect
- Hamilton Cycles, Minimum Degree, and Bipartite Holes
- Coloring the Maximal Cliques of Graphs
- Clique coloring of binomial random graphs
- Stirling Behavior is Asymptotically Normal
