RAINBOW MATCHINGS IN PROPERLY-COLOURED MULTIGRAPHS arXiv:1710.03041v1 [math.CO] 9 Oct 2017 PETER KEEVASH AND LIANA YEPREMYAN Mathematical Institute, University of Oxford.

Source URL: arxiv.org

FINDING HAMILTON CYCLES IN ROBUSTLY EXPANDING DIGRAPHS ¨ DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS Abstract. We provide an NC algorithm for finding Hamilton cycles in directed graphs

Source URL: web.mat.bham.ac.uk

The existence of designs Peter Keevash (University of Oxford) A Steiner Triple System on a set X is a collection T of 3-element subsets of X such that every pair of elements of X is contained in exactly one of the triple

Source URL: www.7ecm.de

• Design of experiments
• Design theory
• Steiner system
• Peter Keevash
• Divisibility rule
• Necessity and sufficiency
• Finite set

Invent math: 291–336 DOIs00222x The early evolution of the H -free process Tom Bohman · Peter Keevash

Source URL: www.math.cmu.edu

ABSTRACTS Gil KALAI — Designs exist! [after Peter Keevash] One of the central and oldest problems in combinatorics is: Can you find a collection S of q-subsets from an n-element set X so that every r-subset of X is in

Source URL: www.bourbaki.ens.fr

The existence of designs - after Peter Keevash Gil Kalai Bourbaki seminar, IHP, Paris, June 27, 2015 Gil Kalai

Source URL: gilkalai.files.wordpress.com

THE EXISTENCE OF DESIGNS PETER KEEVASH Abstract. We prove the existence conjecture for combinatorial designs, answering a question of Steiner fromMore generally, we show that the natural divisibility conditions ar

Source URL: math.ipm.ac.ir

• Probabilistic method
• Function
• Representation theory of finite groups
• Forcing
• Mathematics
• Functions and mappings
• Uniform space