Structured Codes of Graphs

DOI10.1137/22M1487989OpenAlexW4322766571MaRDI QIDQ5883294

Unnamed Author, Unnamed Author, János Körner, Gábor Simonyi, Noga Alon

Publication date: 30 March 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmainduced subgraphsextremal problemsperfect 1-factorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25) Graph designs and isomorphic decomposition (05C51)

Related Items

Largest subgraph from a hereditary property in a random graph, Graph-codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connector families of graphs
• The structure of almost all graphs in a hereditary property
• Triangle-different Hamiltonian paths
• On perfect one-factorization of the complete graph \(K_{2p}\)
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Some intersection theorems for ordered sets and graphs
• Norm-graphs: Variations and applications
• Error-correcting codes from graphs
• Triangle-intersecting families of graphs
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Finite topologies and Hamiltonian paths
• Norm-graphs and bipartite Turán numbers
• Families of Graph-different Hamilton Paths
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A survey on the existence ofG-Designs
• On the entropy values of hereditary classes of graphs
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Perfect 1-factorizations
• Algebraic Coding Theory
• On a combinatorial conjecture of Erdös
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Information Theory
• Combinatorial algebraic topology
• Efficient testing of large graphs