Ben Barber

According to our database1, Ben Barber authored at least 12 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Post-selection-free preparation of high-quality physical qubits.
Quantum, May, 2023

2021
The Namer-Claimer game.
Discret. Math., 2021

2020
Minimalist designs.
Random Struct. Algorithms, 2020

2017
Clique decompositions of multipartite graphs and completion of Latin squares.
J. Comb. Theory A, 2017

Fractional clique decompositions of dense graphs and hypergraphs.
J. Comb. Theory B, 2017

2015
Distinguishing subgroups of the rationals by their Ramsey properties.
J. Comb. Theory A, 2015

Edge-decompositions of graphs with high minimum degree.
Electron. Notes Discret. Math., 2015

2014
Partition Regularity of a System of De and Hindman.
Integers, 2014

Maximum Hitting for n Sufficiently Large.
Graphs Comb., 2014

2013
Partition regularity in the rationals.
J. Comb. Theory A, 2013

Random Walks on Quasirandom Graphs.
Electron. J. Comb., 2013

2012
A note on balanced independent sets in the cube.
Australas. J Comb., 2012


  Loading...