Graphs of small dimensions

DOI10.1007/BF01300127zbMath0853.05049OpenAlexW1994281890MaRDI QIDQ1912752

Nancy Eaton, Vojtěch Rödl

Publication date: 14 May 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300127

zbMATH Keywords

product dimensionset intersection representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Relations of low-dimensional topology with graph theory (57M15)

Related Items (7)

Product dimension of forests and bounded treewidth graphs ⋮ Kneser ranks of random graphs and minimum difference representations ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ On induced and isometric embeddings of graphs into the strong product of paths ⋮ Bounded-depth succinct encodings and the structure they imply on graphs ⋮ On set intersection representations of graphs

Cites Work

• Covering graphs by the minimum number of equivalence relations
• On the dimensions of ordered sets of bounded degree
• On a product dimension of graphs
• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• Orthogonal partitions and covering of graphs
• Probability Inequalities for Sums of Bounded Random Variables
• The Representation of a Graph by Set Intersections

This page was built for publication: Graphs of small dimensions