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

DOI10.1016/0012-365X(82)90184-4zbMATH Open0489.05054MaRDI QIDQ1166545FDOQ1166545

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

• Title not available (Why is that?)
• Representation of a finite graph by a set of intervals on the real line
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• 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
• Counting Interval Graphs

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)