hsfzLZH1's Homepage
2026
- Which finite shapes must appear in one color
- Finding a vertex whose second neighborhood is at least as large as its first
- A spanning tree that stays thin across every cut
- Fractional covers, discrete convexity, and random-graph thresholds
- 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