Journal: Combinatorics, Probability & Computing

Volume 18, Issue 6

861 -- 870Pablo Candela. Structure Along Arithmetic Patterns in Sequences of Vectors
871 -- 880Javier Cilleruelo, Yahya Ould Hamidoune, Oriol Serra. On Sums of Dilates
881 -- 912Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik. A Spectral Approach to Analysing Belief Propagation for 3-Colouring
913 -- 923David Conlon. Hypergraph Packing and Sparse Bipartite Ramsey Numbers
925 -- 952Tobias Müller, Jean-Sébastien Sereni. Identifying and Locating-Dominating Codes in (Random) Geometric Networks
953 -- 978Hongxun Qin, Daniel C. Slilaty, Xiangqian Zhou. The Regular Excluded Minors for Signed-Graphic Matroids
979 -- 1017Nathan Ross. Step Size in Stein's Method of Exchangeable Pairs

Volume 18, Issue 5

617 -- 618Graham Brightwell. Introduction
619 -- 627Noga Alon. Economical Elimination of Cycles in the Torus
629 -- 646József Balogh, Tom Bohman, Dhruv Mubayi. Erdos-Ko-Rado in Random Hypergraphs
647 -- 681Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger. The Degree Sequence of Random Graphs from Subcritical Classes
683 -- 689Andrzej Dudek, Peter Frankl, Vojtech Rödl. A Note on Universal and Canonically Coloured Sequences
691 -- 705György Elekes, Miklós Simonovits, Endre Szabó. A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?
707 -- 724Stefan Felsner, Kolja B. Knauer. ULD-Lattices and Delta-Bonds
725 -- 729Zoltán Füredi, Lale Özkahya. On 14-Cycle-Free Subgraphs of the Hypercube
731 -- 748Jerrold R. Griggs, Linyuan Lu. On Families of Subsets With a Forbidden Subposet
749 -- 764L. Ilinca, Jeff Kahn. On the Number of 2-SAT Functions
765 -- 774Hal A. Kierstead, Alexandr V. Kostochka. Efficient Graph Packing via Game Colouring
775 -- 801Michael Krivelevich, Benny Sudakov, Dan Vilenchik. On the Random Satisfiable Process
803 -- 818Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht. On Colourings of Hypergraphs Without Monochromatic Fano Planes
819 -- 834János Pach, Gábor Tardos. Conflict-Free Colourings of Graphs and Hypergraphs
835 -- 860M. Sammer, Prasad Tetali. Concentration on the Discrete Torus Using Transportation

Volume 18, Issue 4

459 -- 476Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij. Sizes of Induced Subgraphs of Ramsey Graphs
477 -- 516Guillaume Chapuy. Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces
517 -- 532Marcos A. Kiwi, José Soto. On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences
533 -- 549Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless. Subgraphs of Random ::::k::::-Edge-Coloured ::::k::::-Regular Graphs
551 -- 582Jesús A. De Loera, Jon Lee, S. Margulies, Shmuel Onn. Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert s Nullstellensatz
583 -- 599Colin McDiarmid. Random Graphs from a Minor-Closed Class
601 -- 615Criel Merino, Steven D. Noble. The Equivalence of Two Graph Polynomials and a Symmetric Function

Volume 18, Issue 3

301 -- 308Michael H. Albert, Steve Linton. Growing at a Perfect Speed
309 -- 333Bálint Felszeghy, Gábor Hegedüs, Lajos Rónyai. Algebraic Properties of Modulo ::::q:::: Complete ::::l::::-Wide Families
335 -- 355Ben Joseph Green, Terence Tao. Freiman s Theorem in Finite Fields via Extremal Set Theory
357 -- 369Hamed Hatami. Decision Trees and Influences of Variables Over Product Probability Spaces
371 -- 421Craig Lennon, Boris Pittel. On the Likely Number of Solutions for the Stable Marriage Problem
423 -- 434Wenbo V. Li, Xinyi Zhang. On the Difference of Expected Lengths of Minimum Spanning Trees
435 -- 440Allan Siu Lun Lo. Triangles in Regular Graphs with Density Below One Half
441 -- 454Dhruv Mubayi, Reshma Ramadurai. Simplex Stability
455 -- 458Vladimir Nikiforov. A Spectral Erdös-Stone-Bollobás Theorem

Volume 18, Issue 1-2

1 -- 0Noga Alon, Béla Bollobás. Introduction
3 -- 15Noga Alon. Perturbed Identity Matrices Have High Rank: Proof and Applications
17 -- 51József Balogh, Béla Bollobás, Robert Morris. Majority Bootstrap Percolation on the Hypercube
53 -- 81Robert Berke, Tibor Szabó. Deciding Relaxed Two-Colourability: A Hardness Jump
83 -- 106Béla Bollobás, Svante Janson, Oliver Riordan. Line-of-Sight Percolation
107 -- 122Irit Dinur, Ehud Friedgut. Intersecting Families are Essentially Contained in Juntas
123 -- 144Benjamin Doerr, Tobias Friedrich. Deterministic Random Walks on the Two-Dimensional Grid
145 -- 163Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. Line-of-Sight Networks
165 -- 203Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan. The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
205 -- 225Svante Janson. The Probability That a Random Multigraph is Simple
227 -- 245Nathan Linial, Adi Shraibman. Learning Complexity vs Communication Complexity
247 -- 258Po-Shen Loh, Benny Sudakov. Constrained Ramsey Numbers
259 -- 270Martin Marciniszyn, Reto Spöhel, Angelika Steger. Upper Bounds for Online Ramsey Games in Random Graphs
271 -- 300Martin Marciniszyn, Reto Spöhel, Angelika Steger. Online Ramsey Games in Random Graphs