<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-10-07 12:08:41Topology Topological combinatorics Kneser graph Borsuk–Ulam theorem Petersen graph Combinatorial topology Graph theory Martin Kneser Discrete mathematics Mathematics Algebraic topology Combinatorics |
| Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note thatDocID: 1r5gC - View Document |
| Optimal real number graph labelings of a subfamily of Kneser graphs∗ Rok Erman† Suzana Jureˇciˇc† Daniel Kr´al’‡ Kris Stopar†DocID: 1lO1A - View Document |
| An Application of Stahl’s Conjecture About the k-tuple Chromatic Numbers of Kneser Graphs Svata Poljak and Fred S. Roberts∗ Abstract A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so thDocID: 1kdjf - View Document |
| Table of Contents Number TheoryDocID: 4r5J - View Document |
| Table of Contents Number TheoryDocID: 4h66 - View Document |