| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654670 | European Journal of Combinatorics | 2009 | 13 Pages |
Abstract
We prove an analog of results by Erdős-Ko-Rado and Greenwell-Lovász by characterising the maximum stable sets in special vertex-transitive subgraphs of powers of complete graphs, and proving that these graphs admit a unique optimal vertex colouring, up to permutation of the coordinates.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gábor Kun, Benoit Larose,