hsfzLZH1's Homepage
2026
- Predicting graph appearance from the expected counts of all subgraphs
- Sparse higher-dimensional spaces with no hidden parity obstructions
- Why a perfectly orthogonal cyclic sign pattern would stop at length four
- Constructing exact nonbipartite Ramanujan graphs at prescribed sizes
- One cycle through every vertex of a cubic bipartite polyhedron
- A power saving for sets avoiding polynomial differences
- 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