On small graphs with highly imperfect powers

DOI10.1016/0012-365X(92)90447-NzbMath0764.05027MaRDI QIDQ1198509

Yoshiharu Kohayakawa, Jerzy Wojciechowski

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

boundvertex-colouringsmall graphshighly imperfect powers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• A note on the independence number of triangle-free graphs
• On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs
• A note on Ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• Graph Theory and Probability. II
• On L₂-Golourings of a Graph
• On the construction of certain graphs
• On a combinatorial conjecture of Erdös

This page was built for publication: On small graphs with highly imperfect powers