Pages that link to "Item:Q1182823"
From MaRDI portal
The following pages link to Embedding finite graphs into graphs colored with infinitely many colors (Q1182823):
Displaying 6 items.
- King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments (Q521361) (← links)
- Coloring of universal graphs (Q1073812) (← links)
- A consistent edge partition theorem for infinite graphs (Q1332974) (← links)
- A Ramsey-style extension of a theorem of Erdős and Hajnal (Q2773241) (← links)
- Strong embeddings of graphs into colored graphs (Q4071274) (← links)
- Chromatic Ramsey theory (Q5961465) (← links)