vix.ing · top · new · best · stats · spec

Coloring nearly-disjoint hypergraphs with n + o(n) colors

1992/01/01 by Jeff Kahn · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Computer science #Conjecture #Discrete mathematics #Disjoint sets #Edge coloring #Graph #Graph Labeling and Dimension Problems #Graph power #Hypergraph #Index (typography) #Limits and Structures in Graph Theory #Line graph #Mathematics

paper · pdf · doi:10.1016/0097-3165(92)90096-d

crossref issued 1992/01/01 · crossref published 1992/01/01 · crossref published-print 1992/01/01 · openalex publication_date 1992/01/01 · crossref created 2004/09/08 · crossref deposited 2019/02/03 · openalex created_date 2025/10/10 · crossref indexed 2026/03/26 · openalex updated_date 2026/07/31

Citations

Cited by