19 results
Noise sensitivity of the minimum spanning tree of the complete graph
- Part of
-
- Journal:
- Combinatorics, Probability and Computing , First View
- Published online by Cambridge University Press:
- 23 May 2024, pp. 1-16
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Towards the 0-statement of the Kohayakawa-Kreuter conjecture
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 32 / Issue 2 / March 2023
- Published online by Cambridge University Press:
- 27 September 2022, pp. 225-268
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Short proofs for long induced paths
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 31 / Issue 5 / September 2022
- Published online by Cambridge University Press:
- 11 February 2022, pp. 870-878
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Sequential metric dimension for random graphs
- Part of
-
- Journal:
- Journal of Applied Probability / Volume 58 / Issue 4 / December 2021
- Published online by Cambridge University Press:
- 22 November 2021, pp. 909-951
- Print publication:
- December 2021
-
- Article
- Export citation
Disjointness graphs of segments in the space
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 04 November 2020, pp. 498-512
-
- 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
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
Finding independent transversals efficiently
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 5 / September 2020
- Published online by Cambridge University Press:
- 14 May 2020, pp. 780-806
-
- Article
- Export citation
Estimating parameters associated with monotone properties
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 4 / July 2020
- Published online by Cambridge University Press:
- 24 March 2020, pp. 616-632
-
- 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
A BOUND FOR THE CHROMATIC NUMBER OF ($P_{5}$, GEM)-FREE GRAPHS
- Part of
-
- Journal:
- Bulletin of the Australian Mathematical Society / Volume 100 / Issue 2 / October 2019
- Published online by Cambridge University Press:
- 28 March 2019, pp. 182-188
- Print publication:
- October 2019
-
- Article
- Export citation
The spread of fire on a random multigraph
- Part of
-
- Journal:
- Advances in Applied Probability / Volume 51 / Issue 1 / March 2019
- Published online by Cambridge University Press:
- 22 July 2019, pp. 1-40
- Print publication:
- March 2019
-
- Article
- Export citation
Convex Polygons in Geometric Triangulations†
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 5 / September 2017
- Published online by Cambridge University Press:
- 30 May 2017, pp. 641-659
-
- Article
- Export citation
The Threshold Probability for Long Cycles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 2 / March 2017
- Published online by Cambridge University Press:
- 08 September 2016, pp. 208-247
-
- Article
- Export citation
Orientability Thresholds for Random Hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 24 / Issue 5 / September 2015
- Published online by Cambridge University Press:
- 23 March 2015, pp. 774-824
-
- Article
- Export citation
Easily Testable Graph Properties
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 24 / Issue 4 / July 2015
- Published online by Cambridge University Press:
- 02 February 2015, pp. 646-657
-
- Article
- Export citation
On the Length of a Random Minimum Spanning Tree
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 25 / Issue 1 / January 2016
- Published online by Cambridge University Press:
- 23 January 2015, pp. 89-107
-
- Article
- Export citation
On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem
- Part of
-
- Journal:
- Journal of Applied Probability / Volume 51 / Issue 1 / March 2014
- Published online by Cambridge University Press:
- 30 January 2018, pp. 106-117
- Print publication:
- March 2014
-
- Article
-
- You have access
- Export citation
Exponential Random Graphs as Models of Overlay Networks
- Part of
-
- Journal:
- Journal of Applied Probability / Volume 46 / Issue 1 / March 2009
- Published online by Cambridge University Press:
- 14 July 2016, pp. 199-220
- Print publication:
- March 2009
-
- Article
-
- You have access
- Export citation