Graph-codes

DOI10.1016/j.ejc.2023.103880arXiv2301.13305MaRDI QIDQ6189687

Noga Alon

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(\mathcal H\)-codesymmetric difference of two graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Special sequences and polynomials (11B83) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidding just one intersection
• Intersection theorems with geometric consequences
• Edge-coloring cliques with three colors on all 4-cliques
• Triangle-intersecting families of graphs
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• On difference sets of sequences of integers. III
• Structured Codes of Graphs
• \(K_4\)-intersecting families of graphs

This page was built for publication: Graph-codes