Pages that link to "Item:Q2000563"
From MaRDI portal
The following pages link to An Erdős-Gallai type theorem for vertex colored graphs (Q2000563):
Displaying 5 items.
- Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings (Q1977407) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q2883632) (← links)
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)