Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
Journal of Graph Theory · 31.10.2026
DOI: 10.1002/jgt.70151 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 31.10.2026. Verfasst von Patrick Bennett und 2 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: Simons Foundation, National Science Foundation.
Abstract (Originalsprache)
Recently, Alon introduced the notion of an ‐code for a graph : a collection of graphs on vertex set is an ‐code if it contains no two members whose symmetric difference is isomorphic to . Let denote the maximum possible cardinality of an ‐code, and let . Alon observed that a lower bound on can be obtained by attaining an upper bound on the number of colors needed to edge‐color so that every copy of has an odd color class. Motivated by this observation, we define to be the minimum number of colors needed to edge‐color a graph so that every copy of has an odd color class. We prove and . The first result shows and was obtained independently in [9].
Förderung
- Simons Foundation
- National Science Foundation
Zitieren
APA
Bennett, P., Heath, E., & Zerbib, S. (2026). Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class. Journal of Graph Theory. https://doi.org/10.1002/jgt.70151
Vancouver
Bennett P, Heath E, Zerbib S. Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class. Journal of Graph Theory. 2026. doi:10.1002/jgt.70151
BibTeX
@article{Bennett2026,
author = {Bennett, Patrick and Heath, Emily and Zerbib, Shira},
title = {Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class},
journal = {Journal of Graph Theory},
year = {2026},
doi = {10.1002/jgt.70151}
}
EUVIMED