Separation dimension and sparsity

DOI10.1002/JGT.22236MaRDI QIDQ4553724zbMATH OpenOpenAlexFDO

Authors Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

Publication date 31 October 2018

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.22236

zbMATH Keywords

degeneracyedge densityseparation dimension

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Recommendations

• Separation dimension of graphs and hypergraphs
• Separation dimension of bounded degree graphs
• Separation dimension and degree
• Boxicity and separation dimension
• Fractional and circular separation dimension of graphs

Cited in

(11)

• Fractional and circular separation dimension of graphs
• Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
• Boxicity and separation dimension
• Separation dimension of graphs and hypergraphs
• Separation dimension of bounded degree graphs
• Separation dimension and degree
• Splitting Enables Overcoming the Curse of Dimensionality
• Turán-type results for intersection graphs of boxes
• Perfect and nearly perfect separation dimension of complete and random graphs
• Coloring lines and Delaunay graphs with respect to boxes
• A survey on the boxicity and cubicity of graphs

This page was built for publication: Separation dimension and sparsity

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