Back to search

A generalization of Kneser’s conjecture

Data up to Jan 2025

Published2011
Citations11
References22

Total Citations Per Year

Abstract

References (22)

Kneser's conjecture, chromatic number, and homotopy

1978 • 855 citations

Using the Borsuk–Ulam Theorem

2008 • 633 citations

SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

1967 • 387 citations

Topics in Discrete Mathematics

2006 • 156 citations

A Combinatorial Proof of Kneser’s Conjecture*

2004 • 130 citations

Vertex-crtical subgraphs of Kneser-graphs

1978 • 128 citations

A Generalization of Tucker's Combinatorial Lemma with Topological Applications

1952 • 115 citations

Vertex-critical subgraphs of Kneser-graphs

1978 • 101 citations

Local Chromatic Number, KY Fan's Theorem, And Circular Colorings

2006 • 100 citations

Ein Satz �ber abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen

1954 • 100 citations

Recent Developments in Circular Colouring of Graphs

2007 • 73 citations

Colorful subgraphs in Kneser-like graphs

2007 • 38 citations

A constructive proof of Ky Fan's generalization of Tucker's lemma

2005 • 37 citations

Circular chromatic number of Kneser graphs

2003 • 31 citations

A topological lower bound for the circular chromatic number of Schrijver graphs

2005 • 29 citations

Graph Powers and Graph Homomorphisms

2010 • 27 citations

A new coloring theorem of Kneser graphs

2010 • 23 citations

A topological lower bound for the circular chromatic number of Schrijver graphs

2005 • 20 citations

Local coloring of Kneser graphs

2008 • 15 citations

On the Local Colorings of Graphs.

2008 • 10 citations

Circular coloring and Mycielski construction

2010 • 5 citations

Deleted Work

1955 • 0 citations

Cited By (0)

Loading...