8645 results in Discrete Mathematics, Information Theory and Coding
3 - Topological connectedness and independent sets in graphs
-
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp 89-114
-
- Chapter
- Export citation
Contents
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp v-vi
-
- Chapter
- Export citation
7 - Extremal theory of vertex or edge ordered graphs
-
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp 221-236
-
- Chapter
- Export citation
4 - Expanders – how to find them, and what to find in them
-
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp 115-142
-
- Chapter
- Export citation
2 - Analytic representations of large graphs
-
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp 57-88
-
- Chapter
- Export citation
5 - Supersingular isogeny graphs in cryptography
-
-
- Book:
- Surveys in Combinatorics 2019
- Published online:
- 17 June 2019
- Print publication:
- 27 June 2019, pp 143-166
-
- Chapter
- Export citation
On the union of intersecting families
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 6 / November 2019
- Published online by Cambridge University Press:
- 27 June 2019, pp. 826-839
-
- Article
- Export citation
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
![](https://assets.cambridge.org/97811087/40722/cover/9781108740722.jpg)
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