- Computational Complexity of Some Restricted Instances of 3SAT
- On graph decompositions modulo k Department of Pure Mathematics
- Independent sets and repeated degrees B. Bollobas and A.D. Scott
- A new bound for the cops and robbers problem Benny Sudakov
- Maximum directed cuts in acyclic digraphs Bela Bollobas
- Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities
- Judicious partitions of hypergraphs B. Bollobas and A.D. Scott
- ANOTHER SIMPLE PROOF OF A THEOREM OF Abstract. In this note we give a short proof of a theorem of
- The complexity of flood-filling games on Kitty Meeks and Alexander Scott
- Disjoint paths in tournaments Maria Chudnovsky1
- Monochromatic cycles and the monochromatic circumference in 2-coloured graphs
- COVERING NUMBERS FOR GRAPHS AND HYPERGRAPHS
- SZEMEREDI'S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS
- STRUCTURE OF RANDOM r-SAT BELOW THE PURE LITERAL THRESHOLD
- The Minimal Covering Set in Large Tournaments
- Intersections of graphs Bela Bollobas
- Max k-cut and judicious k-partitions Bela Bollobas
- Some variants of the exponential formula, with application to the
- LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP
- On separating systems Bela Bollobas
- Infinite locally random graphs Pierre Charbit
- On Dependency Graphs and the Lattice Gas Alexander D. Scott
- Reconstructing under group actions A.J. Radcliffe1
- SOLVING SPARSE RANDOM INSTANCES OF MAX CUT AND MAX 2-CSP IN LINEAR EXPECTED TIME
- Discrepancy in graphs and hypergraphs B. Bollobas
- The Repulsive Lattice Gas, the Independent-Set Polynomial,
- A NOTE ON CYCLE LENGTHS IN GRAPHS R.J. GOULD, P.E. HAXELL, AND A.D. SCOTT
- Reconstructing subsets of Zn A.J. Radcliffe 1
- Reconstructing sequences Department of Pure Mathematics
- All trees contain a large induced sub-graph having all degrees 1 (mod k)
- Better bounds for perpetual gossiping Department of Pure Mathematics
- A Proof of a Conjecture of Bondy con-cerning paths in weighted digraphs
- Judicious partitions of graphs Bela Bollobas and Alexander Scott
- The complexity of Free-Flood-It on 2 n Kitty Meeks and Alexander Scott
- EXACT BOUNDS FOR JUDICIOUS PARTITIONS OF B. BOLLOBAS1,3
- Polynomial Constraint Satisfaction Problems, Graph Bisection, and the Ising Partition Function
- An LP-Designed Algorithm for Constraint Satisfaction
- Judicious partitions and related problems Many classical partitioning problems in combinatorics ask for a single quantity
- Large induced subgraphs with all degrees odd Department of Pure Mathematics and Mathematical Statistics,
- Max Cut for random graphs with a planted B. Bollobas
- INDUCED CYCLES AND CHROMATIC NUMBER DEPARTMENT OF MATHEMATICS
- Separating systems and oriented graphs of diameter two
- Reconstructing subsets of reals A.J. Radcliffe 1
- Almost all H-free graphs have the Erdos-Hajnal Martin Loebl
- Induced trees in graphs of large chromatic number
- The parameterised complexity of list problems on graphs of bounded treewidth
- ON RYSER'S CONJECTURE P.E. HAXELL AND A.D. SCOTT
- For most graphs H, most H-free graphs have a linear homogeneous set
