King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments

zbMath1358.05093arXiv1705.00896MaRDI QIDQ521361

Kristóf Bérczi, Attila Joó

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.00896

zbMATH Keywords

infinite graphtournamentkernel by monochromatic pathsking-serf duo

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent domination by monochromatic paths in arc coloured bipartite tournaments
• Quasi-kernels and quasi-sinks in infinite graphs
• On monochromatic paths in m-coloured tournaments
• On monochromatic paths in edge-coloured digraphs
• Embedding finite graphs into graphs colored with infinitely many colors
• Kernels in edge-colored digraphs
• A counterexample to a conjecture on edge-coloured tournaments
• On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
• On monochromatic paths and monochromatic cycles in edge coloured tournaments
• Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
• Monochromatic paths and monochromatic sets of arcs in bipartite tournaments

This page was built for publication: King-serf duo by monochromatic paths in \(k\)-edge-coloured tournaments