902 results in 05Cxx
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
THE NUMBER OF ROOTS OF A POLYNOMIAL SYSTEM
- Part of
-
- Journal:
- Bulletin of the Australian Mathematical Society / Volume 103 / Issue 3 / June 2021
- Published online by Cambridge University Press:
- 09 November 2020, pp. 369-378
- Print publication:
- June 2021
-
- Article
- 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
The bandwidth theorem for locally dense graphs
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 8 / 2020
- Published online by Cambridge University Press:
- 04 November 2020, e42
-
- Article
-
- You have access
- Open access
- Export citation
A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 8 / 2020
- Published online by Cambridge University Press:
- 30 October 2020, e37
-
- Article
-
- You have access
- Open access
- 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
PSEUDO-FINITE SETS, PSEUDO-O-MINIMALITY
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 2 / June 2021
- Published online by Cambridge University Press:
- 26 October 2020, pp. 577-599
- Print publication:
- June 2021
-
- 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
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
The virtually generating graph of a profinite group
- Part of
-
- Journal:
- Canadian Mathematical Bulletin / Volume 64 / Issue 4 / December 2021
- Published online by Cambridge University Press:
- 15 October 2020, pp. 808-819
- Print publication:
- December 2021
-
- 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
CLASSES OF BARREN EXTENSIONS
- Part of
-
- Journal:
- The Journal of Symbolic Logic / Volume 86 / Issue 1 / March 2021
- Published online by Cambridge University Press:
- 05 October 2020, pp. 178-209
- Print publication:
- March 2021
-
- Article
- Export citation
CONNECTIVITY PROPERTIES OF MCKAY QUIVERS
- Part of
-
- Journal:
- Bulletin of the Australian Mathematical Society / Volume 103 / Issue 2 / April 2021
- Published online by Cambridge University Press:
- 02 October 2020, pp. 182-194
- Print publication:
- April 2021
-
- Article
- Export citation
Small trees in supercritical random forests
- Part of
-
- Journal:
- Canadian Mathematical Bulletin / Volume 64 / Issue 3 / September 2021
- Published online by Cambridge University Press:
- 29 September 2020, pp. 605-623
- Print publication:
- September 2021
-
- Article
- Export citation