hsfzLZH1's Homepage
2026
- Partitioning every graph into only linearly many cycles and edges
- Fewer balanced lines through a planar point set
- A full logarithmic gain from excluding a fixed clique
- Where unrestricted infinite matroid packing and covering break down
- How narrow must a symmetric random-graph transition be
- Making Snaky in at most twenty-one moves
- The precise residue of random triangle removal
- The exact threshold for a red cycle or a blue clique
- Why rare ordered binary patterns can be hard to remove
- A Boolean function can beat the square-root degree bound by any factor