A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s

DOI10.1016/0095-8956(88)90062-7zbMath0607.05033OpenAlexW1998198961MaRDI QIDQ1085175

J. P. Mayberry, Charles F. Laywine

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90062-7

zbMATH Keywords

edge coloringRamsey theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors ⋮ A new construction technique of a triangle-free 3-colored K16's

Cites Work

• Schur numbers and the Ramsey numbers N(3,3,\dots ,3;2)
• On the Ramsey numbers N(3,3,\dots ,3;2)
• On the maximal triangle-free edge-chromatic graphs in three colors

This page was built for publication: A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s