Structured Codes of Graphs

DOI10.1137/22M1487989OpenAlexW4322766571MaRDI QIDQ5883294FDOQ5883294

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

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

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)

Cites Work

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

Cited In (14)

• Phase transitions of structured codes of graphs
• Constrained Codes as Networks of Relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Network coding in undirected graphs is either very helpful or not helpful at all
• An Introduction to Coding Sequences of Graphs
• Codeterminantal graphs
• Graph-codes
• Connectivity graph-codes
• Sparse codes derived from graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Largest subgraph from a hereditary property in a random graph
• Title not available (Why is that?)

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)