8651 results in Discrete Mathematics, Information Theory and Coding
Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 3 / May 2018
- Published online by Cambridge University Press:
- 02 November 2017, pp. 358-386
-
- Article
- Export citation
Counting Intersecting and Pairs of Cross-Intersecting Families
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 16 October 2017, pp. 60-68
-
- Article
- Export citation
Monotone Subsequences in High-Dimensional Permutations
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 16 October 2017, pp. 69-83
-
- Article
- Export citation
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 09 October 2017, pp. 228-244
-
- Article
- Export citation
Uniformly Discrete Forests with Poor Visibility
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 4 / July 2018
- Published online by Cambridge University Press:
- 09 October 2017, pp. 442-448
-
- Article
-
- You have access
- Export citation
Colourings of Uniform Hypergraphs with Large Girth and Applications
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 09 October 2017, pp. 245-273
-
- Article
- Export citation
A Simple SVD Algorithm for Finding Hidden Partitions
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 09 October 2017, pp. 124-140
-
- Article
- Export citation
Bisections of Graphs Without Short Cycles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 28 September 2017, pp. 44-59
-
- Article
- Export citation
Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 14 August 2017, pp. 952-953
-
- Article
-
- You have access
- Export citation
The Growth Constant of Odd Cutsets in High Dimensions
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 208-227
-
- Article
- Export citation
Triangle-Free Subgraphs of Random Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 141-161
-
- Article
- Export citation
Generalized Majority Colourings of Digraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 14 August 2017, pp. 850-855
-
- Article
- Export citation
Minimizing the Number of Triangular Edges
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 4 / July 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 580-622
-
- Article
- Export citation
Anagram-Free Colourings of Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 4 / July 2018
- Published online by Cambridge University Press:
- 08 August 2017, pp. 623-642
-
- Article
- Export citation
Diameter of the Stochastic Mean-Field Model of Distance
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 07 August 2017, pp. 797-825
-
- Article
- Export citation
Exact Minimum Codegree Threshold for K−4-Factors
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 04 August 2017, pp. 856-885
-
- Article
- Export citation
Packing Loose Hamilton Cycles
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 01 August 2017, pp. 839-849
-
- Article
- Export citation
Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 162-185
-
- Article
- Export citation
Correlation Bounds for Distant Parts of Factor of IID Processes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 1-20
-
- Article
- Export citation
Induced Subgraphs With Many Distinct Degrees
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 110-123
-
- Article
- Export citation