8645 results in Discrete Mathematics, Information Theory and Coding
The number of maximum primitive sets of integers
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 28 January 2021, pp. 781-795
-
- Article
- Export citation
Optimal group testing
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 6 / November 2021
- Published online by Cambridge University Press:
- 28 January 2021, pp. 811-848
-
- Article
- Export citation
Permutations with equal orders
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 27 January 2021, pp. 800-810
-
- Article
- Export citation
A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 27 January 2021, pp. 796-799
-
- Article
- Export citation
Full rainbow matchings in graphs and hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 20 January 2021, pp. 762-780
-
- Article
- Export citation
The length of an s-increasing sequence of r-tuples
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 5 / September 2021
- Published online by Cambridge University Press:
- 08 January 2021, pp. 686-721
-
- Article
- Export citation
Cycle partitions of regular graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 18 December 2020, pp. 526-549
-
- Article
- Export citation
Counting Hamilton cycles in Dirac hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 17 December 2020, pp. 631-653
-
- Article
- Export citation
Near-perfect clique-factors in sparse pseudorandom graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 11 December 2020, pp. 570-590
-
- Article
- Export citation
Large complete minors in random subgraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 03 December 2020, pp. 619-630
-
- Article
- Export citation
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 19 November 2020, pp. 591-608
-
- Article
-
- You have access
- Open access
- Export citation
Lipschitz bijections between boolean functions
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 16 November 2020, pp. 513-525
-
- Article
- Export citation
Making Kr+1-free graphs r-partite
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 10 November 2020, pp. 609-618
-
- Article
-
- You have access
- Open access
- Export citation
Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 05 November 2020, pp. 550-569
-
- Article
-
- You have access
- Export citation
Subgraph counts for dense random graphs with specified degrees
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 05 November 2020, pp. 460-497
-
- 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
A discrepancy version of the Hajnal–Szemerédi theorem
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 30 October 2020, pp. 444-459
-
- Article
- Export citation
The minimum perfect matching in pseudo-dimension 0 < q < 1
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 27 October 2020, pp. 374-397
-
- Article
-
- You have access
- Open access
- Export citation
A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 26 October 2020, pp. 398-411
-
- Article
- Export citation
Mixing properties of colourings of the ℤd lattice
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 3 / May 2021
- Published online by Cambridge University Press:
- 19 October 2020, pp. 360-373
-
- Article
- Export citation