- Jun Fujisawa
, Akira Saito:
A Pair of Forbidden Subgraphs and 2-Factors. Comb. Probab. Comput. 21(1-2): 149-158 (2012) - Zoltán Füredi:
2-Cancellative Hypergraphs and Codes. Comb. Probab. Comput. 21(1-2): 159-177 (2012) - Qi Ge, Daniel Stefankovic
:
A Graph Polynomial for Independent Sets of Bipartite Graphs. Comb. Probab. Comput. 21(5): 695-714 (2012) - Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
k-Sums in Abelian Groups. Comb. Probab. Comput. 21(4): 582-596 (2012) - Alexander V. Gnedin, Alexander Iksanov
, Alexander Marynych
:
A Generalization of the Erdős-Turán Law for the Order of Random Permutation. Comb. Probab. Comput. 21(5): 715-733 (2012) - Ben Green:
On (Not) Computing the Möbius Function Using Bounded Depth Circuits. Comb. Probab. Comput. 21(6): 942-951 (2012) - András Gyárfás, Gábor N. Sárközy:
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp. Comb. Probab. Comput. 21(1-2): 179-186 (2012) - Ervin Györi, Hao Li:
The Maximum Number of Triangles in C2k+1-Free Graphs. Comb. Probab. Comput. 21(1-2): 187-191 (2012) - Ervin Györi, Nathan Lemons:
Hypergraphs with No Cycle of a Given Length. Comb. Probab. Comput. 21(1-2): 193-201 (2012) - Hamed Hatami, Jan Hladký
, Daniel Král'
, Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. Comb. Probab. Comput. 21(5): 734-742 (2012) - Carlos Hoppen
, Yoshiharu Kohayakawa
, Hanno Lefmann:
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21(1-2): 203-218 (2012) - Hao Huang, Po-Shen Loh
, Benny Sudakov:
The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. 21(3): 442-450 (2012) - Haim Kaplan, Jirí Matousek, Zuzana Safernová
, Micha Sharir:
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21(4): 597-610 (2012) - Gyula O. H. Katona, Gyula Y. Katona
, Zsolt Katona:
Most Probably Intersecting Families of Subsets. Comb. Probab. Comput. 21(1-2): 219-227 (2012) - Peter Keevash, Dhruv Mubayi:
The Turán Number of F3, 3. Comb. Probab. Comput. 21(3): 451-456 (2012) - William B. Kinnersley, Kevin G. Milans, Douglas B. West:
Degree Ramsey Numbers of Graphs. Comb. Probab. Comput. 21(1-2): 229-253 (2012) - Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak
:
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Comb. Probab. Comput. 21(4): 611-622 (2012) - Alexandr V. Kostochka, Matthew P. Yancey:
Large Rainbow Matchings in Edge-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 255-263 (2012) - Tomer Kotek:
Complexity of Ising Polynomials. Comb. Probab. Comput. 21(5): 743-772 (2012) - Choongbum Lee, Benny Sudakov, Dan Vilenchik:
Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. 21(5): 773-801 (2012) - Allan Lo
:
Cliques in Graphs With Bounded Minimum Degree. Comb. Probab. Comput. 21(3): 457-482 (2012) - Assaf Naor:
On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs. Comb. Probab. Comput. 21(4): 623-634 (2012) - Oliver Riordan:
The Phase Transition in the Configuration Model. Comb. Probab. Comput. 21(1-2): 265-299 (2012) - Paul A. Russell:
Compressions and Probably Intersecting Families. Comb. Probab. Comput. 21(1-2): 301-313 (2012) - David Saxton, Andrew Thomason:
List Colourings of Regular Hypergraphs. Comb. Probab. Comput. 21(1-2): 315-322 (2012) - Ádám Timár:
Approximating Cayley Diagrams Versus Cayley Graphs. Comb. Probab. Comput. 21(4): 635-641 (2012) - Raphael Yuster:
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing. Comb. Probab. Comput. 21(6): 952-962 (2012)