Minimum difference representations of graphs

DOI10.1007/s00373-010-0875-3zbMath1203.05105OpenAlexW2022699002MaRDI QIDQ968207

Noah Prince, József Balogh

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0875-3

zbMATH Keywords

random graphsgraph representationtrace of hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Kneser ranks of random graphs and minimum difference representations ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations

Cites Work

• On a product dimension of graphs
• Unavoidable traces of set systems
• The unlabelled speed of a hereditary graph property
• Disjoint representability of sets and their complements
• A jump to the Bell number for hereditary graph properties
• A sharp edge bound on the interval number of a graph
• The Bar Visibility Number of a Graph
• Graphs Having Small Number of Sizes on Induced k‐Subgraphs
• Difference graphs

This page was built for publication: Minimum difference representations of graphs