The following pages link to Ben Barber (Q322200):
Displaying 18 items.
- Partition regularity with congruence conditions (Q376554) (← links)
- Random walks on quasirandom graphs (Q396948) (← links)
- Distinguishing subgroups of the rationals by their Ramsey properties (Q472168) (← links)
- Maximum hitting for \(n\) sufficiently large (Q742567) (← links)
- The Namer-Claimer game (Q2222954) (← links)
- Partition regularity in the rationals (Q2349190) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- A note on balanced independent sets in the cube (Q3166110) (← links)
- Isoperimetry in integer lattices (Q4645032) (← links)
- Minimalist designs (Q5120741) (← links)
- Partition regularity without the columns property (Q5255247) (← links)
- Partition regularity of a system of De and Hindman (Q5495446) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5890900) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- Isoperimetric stability in lattices (Q6073680) (← links)
- Small sums of five roots of unity (Q6096837) (← links)
- Post-selection-free preparation of high-quality physical qubits (Q6410463) (← links)
