8658 results in Discrete Mathematics, Information Theory and Coding
Preface
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp vii-viii
-
- Chapter
- Export citation
On Erdős–Ko–Rado for random hypergraphs I
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 6 / November 2019
- Published online by Cambridge University Press:
- 25 June 2019, pp. 881-916
-
- Article
- Export citation
Surveys in Combinatorics 2019
-
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019
An Improved Upper Bound for Bootstrap Percolation in All Dimensions
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 6 / November 2019
- Published online by Cambridge University Press:
- 17 June 2019, pp. 936-960
-
- Article
- Export citation
Logarithmic Sobolev inequalities in discrete product spaces
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 6 / November 2019
- Published online by Cambridge University Press:
- 13 June 2019, pp. 919-935
-
- Article
- Export citation
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 04 June 2019, pp. 733-739
-
- Article
- Export citation
A fast new algorithm for weak graph regularity
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 03 May 2019, pp. 777-790
-
- Article
- Export citation
Discrete derivative asymptotics of the β-Hermite eigenvalues
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 17 April 2019, pp. 657-674
-
- Article
- Export citation
Weighted counting of solutions to sparse systems of equations
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 15 April 2019, pp. 696-719
-
- Article
- Export citation
Defective and clustered choosability of sparse graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 12 April 2019, pp. 791-810
-
- Article
- Export citation
An asymptotic bound for the strong chromatic number
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 15 March 2019, pp. 768-776
-
- Article
- Export citation
Decomposing Graphs into Edges and Triangles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 3 / May 2019
- Published online by Cambridge University Press:
- 13 March 2019, pp. 465-472
-
- Article
- Export citation
Abelian Logic Gates
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 3 / May 2019
- Published online by Cambridge University Press:
- 13 March 2019, pp. 388-422
-
- Article
- Export citation
A central limit theorem for additive functionals of increasing trees
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 4 / July 2019
- Published online by Cambridge University Press:
- 08 March 2019, pp. 618-637
-
- Article
- Export citation
Decomposing edge-coloured graphs under colour degree constraints
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 01 March 2019, pp. 755-767
-
- Article
- Export citation
Separation Choosability and Dense Bipartite Induced Subgraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 26 February 2019, pp. 720-732
-
- Article
-
- You have access
- Open access
- Export citation
Restricted completion of sparse partial Latin squares
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 20 February 2019, pp. 675-695
-
- Article
- Export citation
Improper colouring of graphs with no odd clique minor
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 04 February 2019, pp. 740-754
-
- Article
- Export citation
Limit laws of planar maps with prescribed vertex degrees
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 4 / July 2019
- Published online by Cambridge University Press:
- 04 February 2019, pp. 519-541
-
- Article
- Export citation
A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 2 / March 2019
- Published online by Cambridge University Press:
- 08 January 2019, pp. 287-302
-
- Article
-
- You have access
- Export citation