Fingerprint
Dive into the research topics of 'Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
Allan Lo, Vincent Pfenninger
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
8
Downloads
(Pure)