The following pages link to Adam Zsolt Wagner (Q782940):
Displaying 23 items.
- Recent trends in combinatorics (Q501088) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains (Q1644964) (← links)
- Two results about the hypercube (Q1671353) (← links)
- Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723) (← links)
- Partition problems in high dimensional boxes (Q2000653) (← links)
- Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
- Infinite Sperner's theorem (Q2068601) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- The Ramsey number of Fano plane versus tight path (Q2309230) (← links)
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) (Q2323091) (← links)
- On the number of union-free families (Q2357013) (← links)
- Monochromatic Hilbert cubes and arithmetic progressions (Q2415085) (← links)
- Applications of graph containers in the Boolean lattice (Q2953701) (← links)
- Tilings in Randomly Perturbed Dense Graphs (Q5219315) (← links)
- An improved lower bound for Folkman's theorem (Q5357107) (← links)
- Large Subgraphs in Rainbow‐Triangle Free Colorings (Q5360880) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)
- Balanced edge-colorings avoiding rainbow cliques of size four (Q6133158) (← links)
- Families in posets minimizing the number of comparable pairs (Q6134650) (← links)
- Intersecting families of sets are typically trivial (Q6144393) (← links)
- Constructions in combinatorics via neural networks (Q6366462) (← links)
- PatternBoost: Constructions in Mathematics with a Little Help from AI (Q6751546) (← links)
