Monochromatic loose paths in multicolored k-uniform cliques
From MaRDI portal
(Redirected from Monochromatic loose paths in multicolored k-uniform cliques)
Monochromatic loose paths in multicolored $k$-uniform cliques
Monochromatic loose paths in multicolored $k$-uniform cliques
Abstract: For integers and , a -uniform hypergraph is called a loose path of length , and denoted by , if it consists of edges such that if and if . In other words, each pair of consecutive edges intersects on a single vertex, while all other pairs are disjoint. Let be the minimum integer such that every -edge-coloring of the complete -uniform hypergraph yields a monochromatic copy of . In this paper we are mostly interested in constructive upper bounds on , meaning that on the cost of possibly enlarging the order of the complete hypergraph, we would like to efficiently find a monochromatic copy of in every coloring. In particular, we show that there is a constant such that for all , , , and , there is an algorithm such that for every -edge-coloring of the edges of , it finds a monochromatic copy of in time at most . We also prove a non-constructive upper bound .
Recommendations
- Monochromatic loose path partitions in k-uniform hypergraphs
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths
- Monochromatic Paths and Triangulated Graphs
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs
- Monochromatic clique decompositions of graphs
- Monochromatic \(k\)-edge-connection colorings of graphs
- Monochromatic loose-cycle partitions in hypergraphs
- On monochromatic paths in m-coloured tournaments
- Monochromatic paths and monochromatic cycles in edge-coloured k-partite tournaments.
Cited in
(2)
This page was built for publication: Monochromatic loose paths in multicolored $k$-uniform cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207843)