Kneser ranks of random graphs and minimum difference representations

DOI10.1016/j.endm.2017.06.079zbMath1378.05185OpenAlexW2800254809MaRDI QIDQ1689964

Ida Kantor, Zoltan Fueredi

Publication date: 18 January 2018

Full work available at URL: http://real.mtak.hu/70727/13/1701.08292v1.pdf

zbMATH Keywords

random graphsintersection graphsKneser graphsclique covers

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Minimum difference representations of graphs
• Graphs of small dimensions
• Unavoidable traces of set systems
• Compact Representations of the Intersection Structure of Families of Finite Sets
• Topics in Intersection Graph Theory
• Difference graphs

This page was built for publication: Kneser ranks of random graphs and minimum difference representations