Perfect and nearly perfect separation dimension of complete and random graphs

DOI10.1002/jcd.21802arXiv2108.13662OpenAlexW3196968457MaRDI QIDQ6186984

Raphael Yuster

Publication date: 5 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.13662

zbMATH Keywords

random graphcomplete graphseparation dimensionperfect separation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Boxicity of line graphs
• The induced separation dimension of a graph
• Fractional and circular separation dimension of graphs
• Perfect sequence covering arrays
• The minrank of random graphs over arbitrary fields
• On the minimum number of completely 3-scrambling permutations
• The Difference Between Consecutive Primes, II
• Boxicity and Separation Dimension
• Separation Dimension of Bounded Degree Graphs
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• On the Shannon capacity of a graph
• A note on scrambling permutations
• Separation dimension and sparsity
• The Minrank of Random Graphs
• Circular Separation Dimension of a Subclass of Planar Graphs
• Scrambling permutations and entropy of hypergraphs
• Sequence Covering Arrays
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements