JOURNAL ARTICLE

Generalized Kneser coloring theorems with combinatorial proofs

Günter M. Ziegler

Year: 2002 Journal:   Inventiones mathematicae Vol: 147 (3)Pages: 671-691   Publisher: Springer Science+Business Media
Keywords:
Mathematics Mathematical proof Conjecture Combinatorial proof Generalization Combinatorics Algebraic number Discrete mathematics Graph coloring Hypergraph Greedy coloring Graph

Metrics

62
Cited By
2.03
FWCI (Field Weighted Citation Impact)
16
Refs
0.88
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Topological and Geometric Data Analysis
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Homotopy and Cohomology in Algebraic Topology
Physical Sciences →  Mathematics →  Mathematical Physics
Advanced Combinatorial Mathematics
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics

Related Documents

JOURNAL ARTICLE

Generalized Kneser coloring theorems with combinatorial proofs

Günter M. Ziegler

Journal:   Inventiones mathematicae Year: 2005 Vol: 163 (1)Pages: 227-228
JOURNAL ARTICLE

Easier proofs of coloring theorems

Jan van Mill

Journal:   Topology and its Applications Year: 1999 Vol: 97 (1-2)Pages: 155-163
JOURNAL ARTICLE

Topologic proofs of some combinatorial theorems

Mark Yoseloff

Journal:   Journal of Combinatorial Theory Series A Year: 1974 Vol: 17 (1)Pages: 95-111
JOURNAL ARTICLE

On the generalized Erdős–Kneser conjecture: Proofs and reductions

Jai AslamShuli ChenEthan ColdrenFlorian FrickLinus Setiabrata

Journal:   Journal of Combinatorial Theory Series B Year: 2018 Vol: 135 Pages: 227-237
JOURNAL ARTICLE

Short proofs of coloring theorems on planar graphs

O. V. BorodinAlexandr KostochkaBernard LidickýMatthew Yancey

Journal:   European Journal of Combinatorics Year: 2013 Vol: 36 Pages: 314-321
© 2026 ScienceGate Book Chapters — All rights reserved.