Structured Codes of Graphs

DOI10.1137/22M1487989MaRDI QIDQ5883294zbMATH OpenOpenAlexFDO

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

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

extremal problemsregularity lemmainduced subgraphsperfect 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)

Recommendations

• Graph-based codes
• Codes over graphs
• On graphs and codes
• Codes based on complete graphs
• scientific article; zbMATH DE number 2154518
• Parameterized codes over graphs
• Codes on Graphs: Fundamentals
• Vertex codes of graphs
• Graph theoretic methods in coding theory

Cites work

• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• scientific article; zbMATH DE number 3641492 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 881164 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A survey on the existence ofG-Designs
• Algebraic coding theory
• Combinatorial algebraic topology
• Connector families of graphs
• Efficient testing of large graphs
• Error-correcting codes from graphs
• Families of graph-different Hamilton paths
• Finite topologies and Hamiltonian paths
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Information theory. Coding theorems for discrete memoryless systems
• Norm-graphs and bipartite Turán numbers
• Norm-graphs: Variations and applications
• On a combinatorial conjecture of Erdös
• On a problem of K. Zarankiewicz
• On perfect one-factorization of the complete graph \(K_{2p}\)
• On the density of families of sets
• On the entropy values of hereditary classes of graphs
• On the structure of linear graphs
• Perfect 1-factorizations
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Some intersection theorems for ordered sets and graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The probabilistic method
• The structure of almost all graphs in a hereditary property
• Triangle-different Hamiltonian paths
• Triangle-intersecting families of graphs

Cited in

(14)

• Phase transitions of structured codes of graphs
• Constrained Codes as Networks of Relations
• scientific article; zbMATH DE number 4191159 (Why is no real title available?)
• scientific article; zbMATH DE number 720914 (Why is no real title available?)
• Network coding in undirected graphs is either very helpful or not helpful at all
• Codeterminantal graphs
• An Introduction to Coding Sequences of Graphs
• Graph-codes
• Connectivity graph-codes
• Sparse codes derived from graphs
• scientific article; zbMATH DE number 3908330 (Why is no real title available?)
• scientific article; zbMATH DE number 5999572 (Why is no real title available?)
• Largest subgraph from a hereditary property in a random graph
• scientific article; zbMATH DE number 3974897 (Why is no real title available?)

This page was built for publication: Structured Codes of Graphs

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