Pages that link to "Item:Q1262327"

The following pages link to A Ramsey type problem concerning vertex colourings (Q1262327):

Displaying 15 items.

• The vertex size-Ramsey number (Q267205) (← links)
• Some remarks on vertex Folkman numbers for hypergraphs (Q449143) (← links)
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers (Q653983) (← links)
• An extremal problem on v-partite graphs (Q789407) (← links)
• An almost quadratic bound on vertex Folkman numbers (Q965241) (← links)
• Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs (Q1260770) (← links)
• The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
• Generalizing the Ramsey problem through diameter (Q1856336) (← links)
• The minimum independence number for designs (Q1894699) (← links)
• The complexity of generalized graph colorings (Q1923585) (← links)
• Ramsey-type results for Gallai colorings (Q3055920) (← links)
• (Q4326188) (← links)
• (Q5441568) (← links)
• New Upper Bound on Vertex Folkman Numbers (Q5458552) (← links)
• The asymptotics of \(r(4,t)\) (Q6195365) (← links)