Someproblems in Graph Theory


In this short note I discuss two problems which we discussed during the hyper-graph meeting. I. The following conjecture is attributed to I. Zarins by Bondy and Chvatal : Let k be an integer and n > n 0 (k). Then if G(n) (G(n) is a graph of n ver-tices) is Hamiltonian and does not have k pairwise independent vertices (i .e. the complementary graph does not… (More)


  • Presentations referencing similar topics