A note on graphs with disjoint maximal cliques ans a link with evasiveness
Combinatorics
2018-02-28 v4
Abstract
In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and Payan. It also gives a positive answer to a special case of the evasiveness conjecture.
Cite
@article{arxiv.1703.10819,
title = {A note on graphs with disjoint maximal cliques ans a link with evasiveness},
author = {Etienne Fieux and Bertrand Jouve},
journal= {arXiv preprint arXiv:1703.10819},
year = {2018}
}
Comments
There is an error in the proof of Lemma 2 which affects the Theorems 1 and 3. In the actual state, the main claim (see abstract) remains unproved. 9 pages, 2 figures