18 citations · 23 across the 14 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
math.CO2005★ 1 cited
Colorful subgraphs in Kneser-like graphs
Gábor Simonyi, Gábor Tardos
Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tuc…
math.CO2005
Local chromatic number and distinguishing the strength of topological obstructions
Gábor Simonyi, Gábor Tardos, Siniša T. Vrećica
The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show tha…