default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 21
Volume 21, Numbers 1-2, March 2012
- Ralph J. Faudree:
My Friend and Colleague, Richard Schelp. 1-9
- Paul Balister, Béla Bollobás:
Critical Probabilities of 1-Independent Percolation Models. 11-22 - József Balogh, Choongbum Lee, Wojciech Samotij:
Corrádi and Hajnal's Theorem for Sparse Random Graphs. 23-55 - Fabrício Siqueira Benevides, Tomasz Luczak
, Alex Scott, Jozef Skokan, M. White:
Monochromatic Cycles in 2-Coloured Graphs. 57-87 - Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs: The Erdős-Stone Theorem. 89-105 - Guantao Chen, Han Ren, Songling Shan:
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs. 107-111 - Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. 113-127 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum Degree and Disjoint Cycles in Claw-Free Graphs. 129-139 - Peter Frankl, Vojtech Rödl, Andrzej Rucinski:
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. 141-148 - Jun Fujisawa, Akira Saito:
A Pair of Forbidden Subgraphs and 2-Factors. 149-158 - Zoltán Füredi:
2-Cancellative Hypergraphs and Codes. 159-177 - András Gyárfás, Gábor N. Sárközy:
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp. 179-186 - Ervin Györi, Hao Li:
The Maximum Number of Triangles in C2k+1-Free Graphs. 187-191 - Ervin Györi, Nathan Lemons:
Hypergraphs with No Cycle of a Given Length. 193-201 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. 203-218 - Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona:
Most Probably Intersecting Families of Subsets. 219-227 - William B. Kinnersley, Kevin G. Milans, Douglas B. West:
Degree Ramsey Numbers of Graphs. 229-253 - Alexandr V. Kostochka, Matthew P. Yancey:
Large Rainbow Matchings in Edge-Coloured Graphs. 255-263 - Oliver Riordan:
The Phase Transition in the Configuration Model. 265-299 - Paul A. Russell:
Compressions and Probably Intersecting Families. 301-313 - David Saxton, Andrew Thomason:
List Colourings of Regular Hypergraphs. 315-322
Volume 21, Number 3, May 2012
- Simeon Ball, Valentina Pepe:
Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers. 323-329 - Graham R. Brightwell, Malwina J. Luczak:
Order-Invariant Measures on Fixed Causal Sets. 330-357 - Boris Bukh, Alfredo Hubard:
Space Crossing Numbers. 358-373 - Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros:
Measurable Events Indexed by Trees. 374-411 - Michael Fuchs:
Limit Theorems for Subtree Size Profiles of Increasing Trees. 412-441 - Hao Huang, Po-Shen Loh, Benny Sudakov:
The Size of a Hypergraph and its Matching Number. 442-450 - Peter Keevash, Dhruv Mubayi:
The Turán Number of F3, 3. 451-456 - Allan Lo:
Cliques in Graphs With Bounded Minimum Degree. 457-482
Volume 21, Number 4, July 2012
- M. Amin Bahmanian:
Detachments of Hypergraphs I: The Berge-Johnson Problem. 483-495 - Edward Boehnlein, Tao Jiang:
Set Families With a Forbidden Induced Subposet. 496-511 - Nicolas Bousquet, Stéphan Thomassé:
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. 512-514 - Ernie Croot:
Some Properties of Lower Level-Sets of Convolutions. 515-530 - Péter Csikvári, Zoltán Lóránt Nagy:
The Density Turán Problem. 531-553 - Domingos Dellamonica Jr., Vojtech Rödl:
Distance Preserving Ramsey Graphs. 554-581 - Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
k-Sums in Abelian Groups. 582-596 - Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir:
Unit Distances in Three Dimensions. 597-610 - Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak:
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. 611-622 - Assaf Naor:
On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs. 623-634 - Ádám Timár:
Approximating Cayley Diagrams Versus Cayley Graphs. 635-641
Volume 21, Number 5, September 2012
- Yonatan Bilu, Nathan Linial:
Are Stable Instances Easy? 643-660 - Julia Böttcher, Anusch Taraz, Andreas Würfl:
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. 661-682 - Nicolas Curien:
Strong Convergence of Partial Match Queries in Random Quadtrees. 683-694 - Qi Ge, Daniel Stefankovic:
A Graph Polynomial for Independent Sets of Bipartite Graphs. 695-714 - Alexander V. Gnedin, Alexander Iksanov, Alexander Marynych:
A Generalization of the Erdős-Turán Law for the Order of Random Permutation. 715-733 - Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov:
Non-Three-Colourable Common Graphs Exist. 734-742 - Tomer Kotek:
Complexity of Ising Polynomials. 743-772 - Choongbum Lee, Benny Sudakov, Dan Vilenchik:
Getting a Directed Hamilton Cycle Two Times Faster. 773-801
Volume 21, Number 6, November 2012
- Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. 803-815 - Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller:
Cops and Robbers on Geometric Graphs. 816-834 - Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. 835-855 - Nicolas Broutin, Omar Fawzi:
Longest Path Distance in Random Circuits. 856-881 - Siu On Chan, Michael Molloy:
(k+1)-Cores Have k-Factors. 882-896 - Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau:
Fast Strategies In Maker-Breaker Games Played on Random Boards. 897-915 - Chaim Even-Zohar:
On Sums of Generating Sets in ℤ2 n . 916-941 - Ben Green:
On (Not) Computing the Möbius Function Using Bounded Depth Circuits. 942-951 - Raphael Yuster:
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing. 952-962
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-12 23:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
