EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Defective coloring of hypergraphs

António Girão, Freddie Illingworth, Alex Scott, David R. Wood

Random Structures & Algorithms · 2024-05 · 64 (3) · 663-675

DOI: 10.1002/rsa.21190 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 27.10.2023. Verfasst von António Girão und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Australian Research Council, Engineering and Physical Sciences Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove that the vertices of every ‐uniform hypergraph with maximum degree may be colored with colors such that each vertex is in at most monochromatic edges. This result, which is best possible up to the value of the constant , generalizes the classical result of Erdős and Lovász who proved the case.

Förderung

  • Australian Research Council
  • Engineering and Physical Sciences Research Council

Zitieren

APA

Girão, A., Illingworth, F., Scott, A., & Wood, D. R. (2024). Defective coloring of hypergraphs. Random Structures & Algorithms, 64(3), 663-675. https://doi.org/10.1002/rsa.21190

Vancouver

Girão A, Illingworth F, Scott A, Wood DR. Defective coloring of hypergraphs. Random Structures & Algorithms. 2024;64(3):663-675. doi:10.1002/rsa.21190

BibTeX
@article{Giro2024,
  author = {Girão, António and Illingworth, Freddie and Scott, Alex and Wood, David R.},
  title = {Defective coloring of hypergraphs},
  journal = {Random Structures & Algorithms},
  year = {2024},
  volume = {64},
  number = {3},
  pages = {663--675},
  doi = {10.1002/rsa.21190}
}
Kostenlos starten →