6 results
On tripartite common graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 31 / Issue 5 / September 2022
- Published online by Cambridge University Press:
- 25 May 2022, pp. 907-923
-
- Article
-
- You have access
- Open access
- HTML
- 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
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
Minimizing the number of 5-cycles in graphs with given edge-density
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 1 / January 2020
- Published online by Cambridge University Press:
- 09 October 2019, pp. 44-67
-
- Article
- Export citation
Decomposing Graphs into Edges and Triangles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 3 / May 2019
- Published online by Cambridge University Press:
- 13 March 2019, pp. 465-472
-
- Article
- Export citation
Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 24 / Issue 4 / July 2015
- Published online by Cambridge University Press:
- 19 December 2014, pp. 658-679
-
- Article
- Export citation