Pages that link to "Item:Q1356712"

The following pages link to On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors (Q1356712):

Displaying 7 items.

• A new construction technique of a triangle-free 3-colored K16's (Q881858) (← links)
• Three color Ramsey numbers for graphs with at most 4 vertices (Q1953359) (← links)
• On the 3-color Ramsey numbers \(R(C_4,C_4,W_n)\) (Q2144222) (← links)
• Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking (Q2398438) (← links)
• On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
• Remarks on 15-vertex (3,3)-Ramsey graphs not containing K_5 (Q4347592) (← links)
• On the maximal triangle-free edge-chromatic graphs in three colors (Q5548828) (← links)