Monochromatic paths in 2-edge-coloured graphs and hypergraphs
From MaRDI portal
Publication:2699642
DOI10.37236/11465OpenAlexW4360849271MaRDI QIDQ2699642
Publication date: 19 April 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12464
Ramsey theorymonochromatic pathsmonochromatic cyclesedge colored hypergraphsuniform complete hypergraphs
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Monochromatic loose-cycle partitions in hypergraphs
- The size Ramsey number of a directed path
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
- Monochromatic path and cycle partitions in hypergraphs
- Partitioning a graph into a cycle and a sparse graph
- Towards Lehel's conjecture for 4-uniform tight cycles
- Monochromatic loose path partitions in \(k\)-uniform hypergraphs
- A Ramsey-type problem in directed and bipartite graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Vertex coverings by monochromatic paths and cycles
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles
This page was built for publication: Monochromatic paths in 2-edge-coloured graphs and hypergraphs
