09635483_20-6.qxd 10/20/11 5:37 AM Page 1

Volume 20 Number 6 November 2011 , Probability & Computing Volume 20 Number 6 November 2011

CONTENTS Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence 799 ALESSANDRO ARLOTTO AND J. MICHAEL STEELE Editor-in-Chief: Béla Bollobás Computing the Partition Function for Perfect Matchings in a Hypergraph 815 Managing Editors: Paul Balister, Imre Leader, ALEXANDER BARVINOK AND ALEX SAMORODNITSKY

OUE2 UBR6Nvme 01PAGES 799–955 2011 November NUMBER 6 20 VOLUME Editors: Oliver Riordan Turán Numbers of Multiple Paths and Equibipartite Forests 837 NEAL BUSHAW AND NATHAN KETTLE Noga Alon Graham Brightwell Counting Certain Pairings in Arbitrary Groups 855 Jennifer T. Chayes Y. O . HAMIDOUNE Alan Frieze Sums of Dilates in Groups of Prime Order 867 Zoltán Füredi ALAIN PLAGNE Timothy Gowers Analysis of Statistics for Generalized Stirling Permutations 875 MARKUS KUBA AND ALOIS PANHOLZER Jeff Kahn A Graph Integral Formulation of the Circuit Partition Polynomial 911 Yoshiharu Kohayakawa CRISTOPHER MOORE AND ALEXANDER RUSSELL Alexandr Kostochka Plünnecke’s Inequality 921 Greg Lawler GIORGIS PETRIDIS Tomasz Luczak

The Final Size of the C4-Free Process 939 Colin McDiarmid MICHAEL E. PICOLLELLI Brendan McKay James Oxley Yuval Peres Vojteˇch Rödl Alex Scott Vera Sós Wojciech Szpankowski Andrew Thomason Dominic Welsh Peter Winkler

Cambridge Journals Online For further information about this journal please go to the journal website at: journals.cambridge.org/cpc 0963-5483

Downloaded from https://www.cambridge.org/core. IP address: 170.106.33.22, on 25 Sep 2021 at 02:33:37, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S096354831100054X 09635483_20-6.qxd 10/20/11 5:37 AM Page 2

EDITOR-IN-CHIEF SUBSCRIPTIONS BÉLA BOLLOBÁS: Trinity College, Cambridge CB2 1TQ and Department of Mathematical Sciences, University of Combinatorics, Probability and Computing (ISSN: 0963-5483) is published bimonthly in 2011 in January, March, May, July, Memphis, Memphis, TN 38152, USA, Email: [email protected] and Email: [email protected] September and November by Cambridge University Press, The Edinburgh Building, Shaftesbury Road, Cambridge, CB2 8RU, MANAGING EDITORS UK / Cambridge University Press, 32 Avenue of the Americas, New York, N.Y. 10013–2473. The subscription price of Volume 20, 2011 PAUL BALISTER: Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA, is £380 net (USA, Canada and Mexico US$670) post free, institutions print and electronic; institutions electronic only £340 / $600; Email: [email protected] single parts cost £70 net (USA, Canada and Mexico US$123) plus postage. Prices include delivery by air. Six parts form a volume. Orders IMRE LEADER: Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, must be accompanied by payment, may be sent to any bookseller, subscription agent or to the publisher: Cambridge University Press, Wilberforce Road, Cambridge CB3 0WB, Email: [email protected] The Edinburgh Building, Shaftesbury Road, Cambridge, CB2 8RU, or in the USA, Canada and Mexico to Cambridge University Press, OLIVER RIORDAN: Mathematical Institute, 24-29 St Giles’, Oxford, OX1 3LB, Journals Fulfillment Department, 100 Brook Hill Drive, West Nyack, New York 10994-2133. EU subscribers outside the UK who are Email: [email protected] not registered for VAT should add VAT at their county’s rate. VAT registered subscribers should provide their VAT registration number. JOURNAL EMAIL ADDRESS: [email protected] Japanese prices for institutions are available from Kinokuniya Company Ltd., P.O. Box 55, Chitose, Tokyo156, Japan. Copies of the EDITORIAL BOARD Journal for subscribers in the USA, Canada and Mexico are sent by air to New York. Periodical postage paid at New York, N.Y. and NOGA ALON: Department of Mathematics, , Ramat Aviv, 69978 Tel Aviv, , Email: [email protected] additional mailing offices. POSTMASTER Send address changes to Combinatorics, Probability and Computing, Cambridge University Probabilistic methods in combinatorics GRAHAM BRIGHTWELL: Department of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, Press, 100 Brook Hill Drive, West Nyack, N.Y. 10994-2133. Email: [email protected] Claims for missing issues can only be considered if made immediately upon receipt of the subsequent issue. Copies of back numbers Probabilistic methods and partially ordered sets are available from Cambridge University Press. JENNIFER T. CHAYES: Microsoft Research, One Microsoft Way, Redmond, Washington 98052, USA, Email: [email protected] Percolation, statistical physics methods COPYING This journal is registered with the Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA. 01923, USA. ALAN FRIEZE: Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA 15213, Email: [email protected] Random graphs, algorithms Organisations in the USA who are also registered with the C.C.C. may therefore copy material (beyond the limits permitted by section ZOLTA´N FÜREDI: Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA, Email: [email protected] 107 and 108 of US copyright law) subject to payment to C.C.C. of the per-copy fee of $16.00. This consent does not extend to multiple Set systems, extremal copying for promotional or commercial purposes. Code 0963-5483/11 $16.00. Organisations authorised by the Copyright Licensing TIMOTHY GOWERS: Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, Email: [email protected] Agency may also copy material subject to the usual conditions. ISI Tear Sheet Service, 3501 Market Street, Philadelphia, Pennsylvania Combinatorial , probabilistic combinatorics 19104, USA, is authorised to supply single copies of separate articles for private use only. MARK JERRUM: School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK, Email: [email protected] For all other use, permission should be sought from Cambridge University Press. Randomised algorithms, complexity theory Cover design by Gabriella Bollobás based on a tessellation by Andreas Dress. JEFF KAHN: Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA, Email: [email protected] instructions for authors Extra-combinatorial methods, hypergraphs YOSHIHARU KOHAYAKAWA: Instituto de Matemática e Estatística, University of São Paulo, Rua do Matão 1010, 05508-900 São Paulo, Brazil, Email: [email protected] Editorial policy The journal welcomes submissions in any of the areas of Combinatorics, Probability, or Computer Science, not just Random combinatorial structures, extremal problems those dealing explicitly with relations between the three. Its scope covers combinatorics in a broad sense, including classical and ALEXANDR KOSTOCHKA: Department of Mathematics, University of Illinois, 1409 W. Green Street, Urbana, IL 61801, USA, algebraic graph theory, probabilistic methods, random structures, combinatorial probability and limit theorems for random Email: [email protected] Graphs, hypergraphs combinatorial structures; and the theory of algorithms, including complexity theory, randomised algorithms, probabilistic analysis of GREG LAWLER: Department of Mathematics, University of Chicago, 5734 South University Avenue, Chicago, IL 60637, USA, Email: algorithms, computational learning theory and optimisation. [email protected] Submission of manuscripts Authors are strongly encouraged to submit papers electronically, ideally in the form of a pdf or postscript Probability theory TOMASZ L⁄ UCZAK: Institute of Mathematics, Adam Mickiewicz University, Matejki 48/49, PL-60 769 Poznán, Poland, file. Papers should be sent to the editorial office at [email protected], or can alternatively be submitted through any member of Email : [email protected] Probabilistic methods, random structures the Editorial Board. Papers may also be submitted in hard copy: three copies should be sent accompanied by the author's address, COLIN McDIARMID: Department of Statistics, University of Oxford, 1 South Parks Road, Oxford OX1 3TG, Email : [email protected] Combinatorics, probability and algorithms telephone, fax number, and email address. BRENDAN MCKAY: Computer Science Department, Australian National University, G.P.O. Box 4, Canberra, ACT 2601, Australia, Submission of a paper is taken to imply that it has not been previously published and that it is not being considered for publication Email: [email protected] Probability theory, enumeration, asymptotics JAMES OXLEY: Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803–4918, USA, Email: [email protected] elsewhere. Authors of articles published in the journal assign copyright to Cambridge University Press and will receive a copyright Matroid theory assignment form for signature upon acceptance of their paper. YUVAL PERES: Department of Statistics, 367 Evans Hall, University of California Berkeley, CA 94720-3860, USA, Email: [email protected] Probability on graphs, random walks On final acceptance of a paper, authors will be asked to send LaTeX source code, along with figure files and author-defined macros, ALEXANDER RAZBOROV: Department of Computer Science, University of Chicago, 1100 East 58th Street, Chicago, IL 60637, USA, to the editorial office. The publisher reserves the right to typeset any article by conventional means if the author's LaTeX code presents Email: [email protected] problems in production. Boolean complexity theory VOJTEˇCH RO¨ DL: Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322-2390, USA, Layout of manuscripts Papers should begin with an abstract of not more than 300 words. Papers should also include the relevant 2010 Email : [email protected] Ramsey theory, set systems, extremal problems Mathematical Subject Classification codes. References should be listed in alphabetical order at the end of the main text. ALEX SCOTT: Mathematical Institute, University of Oxford, 24–29 St Giles, Oxford OX1 3LB, Email: [email protected] VERA SÓS: Mathematical Research Institute, Reáltanoda utca 13–15, P.O. Box 127, H-1364 Budapest, Hungary, Email: [email protected] Proof reading Typographical or factual errors only may be changed at proof stage. The publisher reserves the right to charge authors for Graph theory, combinatorics, number theory correction of non-typographical errors. No page charge is made. The journal sends author proofs in pdf format, but requires a marked WOJCIECH SZPANKOWSKI: Purdue University, Department of Computer Sciences, 250 N. University Street, West Lafayette, IN 47907-2066, USA, hard copy to be returned to the publisher unless corrections are very light. See instructions with the pdf proof. Email: [email protected] Analytic algorithmics and combinatorics Offprints No paper offprints are provided, but a pdf of the published article will be sent to the corresponding author. ANDREW THOMASON: Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, Email: [email protected] This journal issue has been printed on FSC-certified paper and cover board. FSC is an independent, non-governmental, not-for-profit Extremal graph theory, Ramsey theory organization established to promote the responsible management of the world’s forests. Please see www.fsc.org for information. DOMINIC WELSH: Mathematical Institute, University of Oxford, 24–29 St Giles, Oxford, OX1 3LB, Email: [email protected] Complexity, algorithms, matroid theory PETER WINKLER: Department of Mathematics, Dartmouth College, Hanover, NH 03755-3551, USA, Email: [email protected] Algorithms, random structures INTERNET ACCESS This journal is included in the Cambridge Journals Online service which can be found at journals.cambridge.org. © CAMBRIDGE UNIVERSITY PRESS 2011

Typeset by Aptara, India. Printed in the United Kingdom at the University Press, Cambridge Downloaded from https://www.cambridge.org/core. IP address: 170.106.33.22, on 25 Sep 2021 at 02:33:37, subject to the Cambridge Core terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S096354831100054X