Article thumbnail

Maximum stable sets in analogs of Kneser and complete graphs

By Gábor Kun and Benoit Larose


AbstractWe 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

Publisher: Elsevier Ltd.
Year: 2009
DOI identifier: 10.1016/j.ejc.2008.03.002
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • https://s3-eu-west-1.amazonaws... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.