Irrepresentability by multiple intersection, or why the interval number is unbounded

DOI10.1016/0012-365X(85)90048-2zbMath0576.05030MaRDI QIDQ1065021

Edward R. Scheinerman

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

simplicial complexescurvesinterval numberplanar convex setsd-dimensional boxesk-uniform hypergraphsP-numbersigma-number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (5)

Interval numbers of powers of block graphs ⋮ On the interval number of random graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Grid intersection graphs and boxicity ⋮ Interval graphs and related topics

Cites Work

• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Characterizing intersection classes of graphs
• Random interval graphs
• A characterization of Robert's inequality for boxicity
• Intersection graphs of curves in the plane
• On double and multiple interval graphs
• Extremal Values of the Interval Number of a Graph
• Topology of Thin Film RC Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Irrepresentability by multiple intersection, or why the interval number is unbounded