The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph

DOI10.1016/0012-365X(82)90184-4MaRDI QIDQ1166545zbMATH OpenFDO

Authors Joel E. Cohen

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphinterval graphbalanced subgraphs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3625441 (Why is no real title available?)
• scientific article; zbMATH DE number 1302393 (Why is no real title available?)
• Representation of a finite graph by a set of intervals on the real line

Cited in

(7)

• Counting Interval Graphs
• Interval graphs and related topics
• An evolution of interval graphs
• Random interval graphs
• Algorithmic aspects of intersection graphs and representation hypergraphs
• Threshold phenomena in random structures
• Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem

This page was built for publication: The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph

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