Browsing by Author "9d946a3e-e2d2-427c-9611-16741f41db12"

Now showing items 1-2 of 2

    • Partitioning edge-colored hypergraphs into few monochromatic tight cycles 
      Rodríguez Bustamante, Sebastián Fernando; Corsten, Jan; Frankl, Nora; Pokrovskiy, Alexey; Skokan, Jozef (Siam, 2020)
      Confirming a conjecture of Gyarfas, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of ...
    • Partitioning infinite hypergraphs into few monochromatic berge-paths 
      Bustamante, Sebastián; Corsten, Jan; Frankl, Nóra (Springer, 2020)
      Extending a result of Rado to hypergraphs, we prove that for all s,k,t is an element of N$$s, k, t \in {\mathbb {N}}$$\end{document} with k >= t >= 2 the vertices of every r=s(k-t+1)-edge-coloured countably infinite complete ...