Pages that link to "Item:Q405239"
From MaRDI portal
The following pages link to Monochromatic loose-cycle partitions in hypergraphs (Q405239):
Displaying 18 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy (Q1753119) (← links)
- Monochromatic path and cycle partitions in hypergraphs (Q1953397) (← links)
- Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Monochromatic loose path partitions in \(k\)-uniform hypergraphs (Q2404368) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
- Monochromatic partitions of complete uniform hypergraphs (Q2719171) (← links)
- Partitioning of loop-free sperner hypergraphs into transversals (Q2867747) (← links)
- Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Monochromatic loose paths in multicolored $k$-uniform cliques (Q5207843) (← links)
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
