8645 results in Discrete Mathematics, Information Theory and Coding
Frozen (Δ + 1)-colourings of bounded degree graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 19 October 2020, pp. 330-343
-
- Article
- Export citation
A non-increasing tree growth process for recursive trees and applications
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 19 October 2020, pp. 79-104
-
- Article
- Export citation
Independent dominating sets in graphs of girth five
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 15 October 2020, pp. 344-359
-
- Article
- Export citation
Covering and tiling hypergraphs with tight cycles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 13 October 2020, pp. 288-329
-
- Article
- Export citation
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 12 October 2020, pp. 412-443
-
- Article
-
- You have access
- Open access
- Export citation
Sharp bounds for decomposing graphs into edges and triangles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 12 October 2020, pp. 271-287
-
- Article
-
- You have access
- Open access
- Export citation
Eigenvalues and triangles in graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 28 September 2020, pp. 258-270
-
- Article
- Export citation
Finding tight Hamilton cycles in random hypergraphs faster
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 23 September 2020, pp. 239-257
-
- Article
- Export citation
Maker–Breaker percolation games I: crossing grids
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 15 September 2020, pp. 200-227
-
- Article
-
- You have access
- Open access
- Export citation
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 09 September 2020, pp. 175-199
-
- Article
-
- You have access
- Open access
- Export citation
Hamiltonian Berge cycles in random hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 08 September 2020, pp. 228-238
-
- Article
- Export citation
Dirac’s theorem for random regular graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 28 August 2020, pp. 17-36
-
- Article
- Export citation
Resilience of the rank of random matrices
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 2 / March 2021
- Published online by Cambridge University Press:
- 28 August 2020, pp. 163-174
-
- Article
- Export citation
Breaking bivariate records
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 18 August 2020, pp. 105-123
-
- Article
- Export citation
Monochromatic cycle partitions in random graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 14 August 2020, pp. 136-152
-
- Article
-
- You have access
- Open access
- Export citation
Many disjoint triangles in co-triangle-free graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 14 August 2020, pp. 153-162
-
- Article
- Export citation
Improved Ramsey-type results for comparability graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 5 / September 2020
- Published online by Cambridge University Press:
- 13 August 2020, pp. 747-756
-
- Article
- Export citation
Robustness of randomized rumour spreading
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 12 August 2020, pp. 37-78
-
- Article
-
- You have access
- Open access
- Export citation
A quantitative Lovász criterion for Property B
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 6 / November 2020
- Published online by Cambridge University Press:
- 07 August 2020, pp. 956-960
-
- Article
- Export citation
Approximately counting bases of bicircular matroids
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 06 August 2020, pp. 124-135
-
- Article
- Export citation