Combinatorial consequences of relatives of the Lusternik-Shnirelman-Borsuk theorem (original) (raw)
Related papers
On some partitioning problems for two-colored point sets
2009
A Sperner-Type Theorem for Set-Partition Systems
The Electronic Journal of Combinatorics, 2005
A relaxed Hadwiger's Conjecture for list colorings
Journal of Combinatorial Theory, Series B, 2007
On the chromatic number of set systems
Random Structures and Algorithms, 2001
Colorful subgraphs in Kneser-like graphs
European Journal of Combinatorics, 2007
Restricted k-color partitions, II
International Journal of Number Theory, 2020
Some generalizations of theorems on vertex coloring
Journal of Combinatorial Theory, Series A, 2006
Multicolored Subsets in Colored Hypergraphs
Journal of Combinatorial Theory, Series A, 1996
Discrete Mathematics, 2002
Subcolorings and the subchromatic number of a graph
Discrete Mathematics, 2003
On List Coloring with Separation of the Complete Graph and Set System Intersections
arXiv (Cornell University), 2022
A note on selective line-graphs and partition colorings
Operations Research Letters, 2019
Graph colourings and partitions
2001
New results on generalized graph coloring
2004
ON THE DEFINING NUMBER OF (2n 2)-VERTEX COLORINGS OF Kn ◊ Kn
Bulletin of The Iranian Mathematical Society, 2011
Colouring set families without monochromatic k-chains
Journal of Combinatorial Theory, Series A, 2019
A Note on Partial List Colorings
Balanced partitions of 3-colored geometric sets in the plane
Coloring by two-way independent sets
Discrete Mathematics, 2009
Avoiding colored partitions of two elements in the
Some Ramsey theorems for finite n-colorable and n-chromatic graphs
2010
On Path Partitions and Colourings in Digraphs
Lecture Notes in Computer Science, 2009
Selective line-graphs and partition colorings
2019
A finite basis characterization of α-split colorings
Discrete Mathematics, 2002
A Combinatorial Proof of Rohlin Theorem
Geometriae Dedicata, 1997
Basis theorems for continuous n-colorings
Journal of Combinatorial Theory, 2011
Red-Blue Clique Partitions and (1-1)-Transversals
The Electronic Journal of Combinatorics, 2016
Short Proofs of the Kneser-Lovász Coloring Principle
Lecture Notes in Computer Science, 2015
A generalization of the 555-color theorem
Proceedings of the American Mathematical Society, 1974
On a generalization of Ramsey theory
Discrete Mathematics, 1982
Partitioning and coloring with degree constraints
A note on partial list coloring
Australas. J Comb., 2010
Lecture Notes in Computer Science, 2002
Toward an uncountable analogue of Gallai's Theorem for colorings of the plane
Conflict free colorings of (strongly) almost disjoint set-systems
Acta Mathematica Hungarica, 2010