Graph-codes: questions, results and methods

DOI10.1007/S11537-026-2536-1MaRDI QIDQ7356856zbMATH OpenFDO

Authors Noga Alon

Publication date 25 September 2026

Published in Japanese Journal of Mathematics. 3rd Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11537-026-2536-1

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial codes (94B25)

Cites work

• \(K_4\)-intersecting families of graphs
• A variant of the classical Ramsey problem
• A variant of the Erdős-Gyárfás problem for K₈
• Edge-Disjoint Spanning Trees of Finite Graphs
• Equations over finite fields. An elementary approach
• Forbidding just one intersection
• Graph-codes
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3233758 (Why is no real title available?)
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• On a combinatorial conjecture of Erdös
• On the Shannon capacity of a graph
• Perfect 1-factorizations
• Phase transitions of structured codes of graphs
• Positive graphs
• Ramsey-type problem for an almost monochromatic \(K_4\)
• Some intersection theorems for ordered sets and graphs
• Structured Codes of Graphs
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• The NP-Completeness of Edge-Coloring
• The probabilistic method
• The probability that a random graph is even-decomposable
• Triangle-intersecting families of graphs
• Upper bounds for linear graph codes

This page was built for publication: Graph-codes: questions, results and methods

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