Kneser ranks of random graphs and minimum difference representations

DOI10.1016/J.ENDM.2017.06.079zbMATH Open1378.05185OpenAlexW2800254809MaRDI QIDQ1689964FDOQ1689964

Authors: Ida Kantor, Zoltán Füredi 

Publication date: 18 January 2018

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

Recommendations

• Kneser ranks of random graphs and minimum difference representations
• Minimum difference representations of graphs
• On random subgraphs of Kneser and Schrijver graphs
• Kneser representations of graphs
• Sharp bounds for the chromatic number of random Kneser graphs

zbMATH Keywords

intersection graphsrandom graphsKneser graphsclique covers

Mathematics Subject Classification ID

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

Cites Work

• Topics in Intersection Graph Theory
• Graphs of small dimensions
• Unavoidable traces of set systems
• Minimum difference representations of graphs
• Difference graphs
• Compact representations of the intersection structure of families of finite sets

Cited In (3)

• Kneser ranks of random graphs and minimum difference representations
• The Minrank of Random Graphs
• Expected values of parameters associated with the minimum rank of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689964)