Colorful subgraphs in Kneser-like graphs
type: Item
instance of: scholarly article
title: Colorful subgraphs in Kneser-like graphs
zbMATH Open document ID: 1125.05042
author: Gábor Tardos
author: Gábor Simonyi
published in: European Journal of Combinatorics
publication date: 2007-11-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0512019
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5213646
MaRDI profile type: Publication
OpenAlex ID: W2083711510
arXiv ID: math/0512019
cites work: The Chromatic Number of Kneser Hypergraphs
cites work: Equivalent Formulations of the Borsuk-Ulam Theorem
cites work: Q4871782
cites work: Homotopy types of box complexes
cites work: Box complexes, neighborhood complexes, and the chromatic number
cites work: TRANSVERSALS OF FAMILIES OF SETS IN $ \mathbb{R}^n$ AND A CONNECTION BETWEEN THE HELLY AND BORSUK THEOREMS
cites work: Coloring graphs with locally few colors
cites work: Q5532260
cites work: A generalization of Tucker's combinatorial lemma with topological applications
cites work: Evenly distributed subsets of \(S^ n\) and a combinatorial application
cites work: A New Short Proof of Kneser's Conjecture
cites work: On graphs with strongly independent color-classes
cites work: Q4828516
cites work: Circular chromatic number and a generalization of the construction of Mycielski.
cites work: Kneser's conjecture, chromatic number, and homotopy
cites work: Q3315532
cites work: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
cites work: Topological lower bounds for the chromatic number: a hierarchy
cites work: A topological lower bound for the circular chromatic number of Schrijver graphs
cites work: Sur le coloriage des graphs
cites work: Q3869375
cites work: Local chromatic number, Ky Fan's theorem, and circular colorings
cites work: Fractional chromatic numbers of cones over graphs
cites work: Q5837940
cites work: Circular chromatic number: A survey
cites work: WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
DOI: 10.1016/J.EJC.2007.04.015
Recommended article: Colorful subhypergraphs in Kneser hypergraphs
Recommended article: Subgraphs of colour-critical graphs
Recommended article: Q3726148
Recommended article: Colorful subhypergraphs in uniform hypergraphs
Recommended article: Colorful induced subgraphs
Recommended article: Q4386291
Recommended article: Q3320411
Recommended article: Subcolorings and the subchromatic number of a graph
Recommended article: On the chromatic number of a subgraph of the Kneser graph
Recommended article: A new coloring theorem of Kneser graphs
description: scientific article