Math Conjectures
HomeReferencesKangEtAl2023EFL

KangEtAl2023EFL

A proof of the Erdős–Faber–Lovász conjecture for large graphs

Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus

misc2023
Citation key
KangEtAl2023EFL
Year
2023
Cited by
1 catalog records
Direct source
Available

Reference note

Why this source is in the ledger

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus, “A proof of the Erdős–Faber–Lovász conjecture for large graphs,” Annals of Mathematics 198 (2023), 537–618, DOI: 10.4007/annals.2023.198.2.2.

Catalog connections

Conjectures citing this source

Source record

Bibliographic fields

Inspect the parsed BibTeX fields
author
Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus
doi
10.4007/annals.2023.198.2.2
note
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus, “A proof of the Erdős--Faber--Lovász conjecture for large graphs,” Annals of Mathematics 198 (2023), 537--618, DOI: 10.4007/annals.2023.198.2.2.
title
A proof of the Erdős--Faber--Lovász conjecture for large graphs
year
2023