Small off-diagonal numbers. Ramsey's theorem and self-complementary graphs. Monochromatic paths in edge-colored graphs. A note on Hamiltonian circuits. On Hamilton's ideals.
Every finite graph is a full subgraph of a rigid graph.
Some relations among invariants of graphs. A remark on a problem of Harary. Hypergraphs and Ramseyian theorems. A note on coefficients of chromatic polynomials. On finite and countable rigid graphs and tournaments.