Upper bounds for linear graph codes

DOI10.1002/RSA.21263MaRDI QIDQ7027476zbMATH OpenFDO

Authors Leo Versteegen

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21263

zbMATH Keywords

randomlineardependent random choiceparity checkgraph codes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Linear codes (general theory) (94B05)

Cites work

• Edge-coloring cliques with three colors on all 4-cliques
• Graph-codes
• New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
• On a problem of K. Zarankiewicz
• Ramsey-type problem for an almost monochromatic \(K_4\)
• Random Graphs and Networks: A First Course
• Structured Codes of Graphs
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Triangle-intersecting families of graphs
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions

Cited in

(4)

• Even-degeneracy of a random graph
• The probability that a random graph is even-decomposable
• A variant of the Erdős-Gyárfás problem for K₈
• Odd-Ramsey numbers of complete bipartite graphs

This page was built for publication: Upper bounds for linear graph codes

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