Colorful subgraphs in Kneser-like graphs

Simple item page
dc.creatorSimonyi, Gábor
dc.creatorTardos, Gábor
dc.date2005-12-01
dc.date.accessioned2026-07-07T06:54:44Z
dc.date.available2026-07-07T06:54:44Z
dc.descriptionCombining 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 Tucker, we also prove the presence of all possible completely multicolored t-vertex complete bipartite graphs in t-colored t-chromatic Kneser graphs and in several of their relatives. In particular, this implies a generalization of a recent result of G. Spencer and F. E. Su.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0512019
dc.identifierhttp://arxiv.org/abs/math/0512019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106046
dc.subjectCombinatorics
dc.subjectAlgebraic Topology
dc.subject05C15
dc.titleColorful subgraphs in Kneser-like graphs
dc.typetext

Files

Collections

arXiv