A note on graphs with disjoint maximal cliques ans a link with evasiveness
From MaRDI portal
(Redirected from Publication:6285016)
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.
This page was built for publication: A note on graphs with disjoint maximal cliques ans a link with evasiveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285016)
