Pages that link to "Item:Q2299254"
From MaRDI portal
The following pages link to Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (Q2299254):
Displaying 9 items.
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426) (← links)
- New lower bounds on the size-Ramsey number of a path (Q2073313) (← links)
- Long monochromatic paths and cycles in 2-colored bipartite graphs (Q2185910) (← links)
- A multipartite Ramsey number for odd cycles (Q4650183) (← links)
- (Q5500314) (← links)
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree (Q5886310) (← links)
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree (Q6057663) (← links)
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (Q6081557) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)