Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 22
Volume 22, Number 1, January 2013
- Péter Csikvári:
Note on the Smallest Root of the Independence Polynomial. 1-8 - Jonathan Cutler, A. J. Radcliffe:
Hypergraph Independent Sets. 9-20 - Victor Falgas-Ravry
, Emil R. Vaughan:
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs. 21-54 - J. Robert Johnson, Klas Markström:
Turán and Ramsey Properties of Subcube Intersection Graphs. 55-70 - Fiachra Knox, Andrew Treglown:
Embedding Spanning Bipartite Graphs of Small Bandwidth. 71-96 - Allan Lo, Klas Markström:
A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. 97-111 - Edward Marchant:
The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle. 112-117 - Ben Morris:
Improved Mixing Time Bounds for the Thorp Shuffle. 118-132 - Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. 133-145 - Paul A. Russell, Mark Walters:
Probably Intersecting Families are Not Nested. 146-160
Volume 22, Number 2, March 2013
- Ivo J. B. F. Adan, Johan van Leeuwaarden, Kilian Raschel:
The Compensation Approach for Walks With Small Steps in the Quarter Plane. 161-183 - Lina Jansson Andrén, Carl Johan Casselgren, Lars-Daniel Öhman:
Avoiding Arrays of Odd Order by Latin Squares. 184-212 - Konstancja Bobecka, Pawel Hitczenko, Fernando López-Blázquez, Grzegorz A. Rempala, Jacek Wesolowski:
Asymptotic Normality Through Factorial Cumulants and Partition Identities. 213-240 - Alex Eustis, Jacques Verstraëte:
On the Independence Number of Steiner Systems. 241-252 - Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders Are Universal for the Class of All Spanning Trees. 253-281 - Carsten Witt:
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions. 294-318
Volume 22, Number 3, May 2013
- Aaron Abrams, Eric Babson, Henry Landau, Zeph Landau, James Pommersheim:
Distributions of Order Patterns of Interval Maps. 319-341 - Christoph Aistleitner:
Normal Numbers and the Normality Measure. 342-345 - József Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young:
Towards a Weighted Version of the Hajnal-Szemerédi Theorem. 346-350 - Ernie Croot, Izabella Laba, Olof Sisask:
Arithmetic Progressions in Sumsets and Lp -Almost-Periodicity. 351-365 - Péter L. Erdös, Zoltán Király, István Miklós:
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. 366-383 - Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma:
A New Bound for the 2/3 Conjecture. 384-393 - Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. 394-416 - Dieter Mitsche, Pawel Pralat:
Revolutionaries and Spies on Random Graphs. 417-432 - Ljuben R. Mutafchiev:
The Size of the Largest Part of Random Weighted Partitions of Large Integers. 433-454 - Niclas Petersson:
The Maximum Displacement for Linear Probing Hashing. 455-476
Volume 22, Number 4, July 2013
- Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. 477-498 - Heidi Gebauer:
Size Ramsey Number of Bounded Degree Graphs for Games. 499-516 - Hamed Hatami, Serguei Norine:
The Entropy of Random-Free Graphons and Properties. 517-526 - Yuri Mejía Miranda, Gordon Slade:
Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals. 527-565 - Ron Peled, Wojciech Samotij, Amir Yehudayoff:
Lipschitz Functions on Expanders are Typically Flat. 566-591 - Gonzalo Fiz Pontiveros:
Freiman Homomorphisms of Random Subsets of. 592-611 - Clifford D. Smyth:
Reimer's Inequality on a Finite Distributive Lattice. 612-621 - Norihide Tokushige:
Cross t-Intersecting Integer Sequences from Weighted Erdős-Ko-Rado. 622-637
Volume 22, Number 5, September 2013
- Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. 639-683 - Michael Ferrara, Michael S. Jacobson, Florian Pfender:
Degree Conditions for H-Linked Digraphs. 684-699 - Samuel Fiorini, Gwenaël Joret, David R. Wood:
Excluded Forest Minors and the Erdős-Pósa Property. 700-721 - Alan M. Frieze, Michael Krivelevich:
On the Non-Planarity of a Random Subgraph. 722-732 - Shinya Fujita, Michitaka Furuya, Kenta Ozeki:
Forbidden Subgraphs Generating Almost the Same Sets. 733-748 - László Lovász, Katalin Vesztergombi:
Non-Deterministic Graph Property Testing. 749-762 - Claire Mathieu, David B. Wilson:
The Min Mean-Weight Cycle in a Random Network. 763-782 - Guillem Perarnau, Oriol Serra:
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. 783-799
Volume 22, Number 6, November 2013
- Yuanan Diao, Gábor Hetyei:
Relative Tutte Polynomials of Tensor Products of Coloured Graphs. 801-828 - Jill Dizona, Brendan Nagle:
Constructive Packings by Linear Hypergraphs. 829-858 - Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster:
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. 859-873 - Hiu-Fai Law, Colin McDiarmid:
On Independent Sets in Graphs with Given Minimum Degree. 874-884 - Florian Lehner:
Random Colourings and Automorphism Breaking in Locally Finite Graphs. 885-909 - Oleg Pikhurko, Emil R. Vaughan:
Minimum Number of k-Cliques in Graphs with Bounded Independence Number. 910-934 - Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. 935-954
a service of 
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 2024-04-25 05:28 CEST 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:
