On the Turán Number of Edge Blow-Ups of Cliques

Type: Article

Publication Date: 2024-09-13

Citations: 0

DOI: https://doi.org/10.1137/23m1623240

Locations

  • SIAM Journal on Discrete Mathematics - View

Similar Works

Action Title Year Authors
+ On Generalized Turán Numbers of Intersecting Cliques 2024 Xiaoli Yuan
Yuejian Peng
+ Turán number of two vertex-disjoint copies of cliques 2024 Caiyun Hu
+ Greedy clique decompositions and the Turán numbers 1995 Sean McGuinness
+ Turán Numbers of Expanded Intersecting Cliques in 3-graphs 2022 Yucong Tang
Tong Li
Guiying Yan
+ On Generalized Turán Number of Two Disjoint Cliques 2022 Xiaoli Yuan
Weihua Yang
+ The Turán number for the edge blow-up of trees 2021 Anyao Wang
Xinmin Hou
Boyuan Liu
Yue Ma
+ A new Turán-type theorem for cliques in graphs 2004 Jürgen Eckhoff
+ PDF Chat On the Maximum Number of Cliques in a Graph 2007 David R. Wood
+ PDF Chat On the Ramsey-Turán Density of Triangles 2021 Tomasz Łuczak
Joanna Polcyn
Christian Reiher
+ On cliques in graphs 1971 J. Spencer
+ On cliques in graphs 1966 P. Erdős
+ On cliques in graphs 1965 J. W. Moon
Leo Moser
+ PDF Chat Ramsey numbers of cubes versus cliques 2014 David Conlon
Jacob Fox
Choongbum Lee
Benny Sudakov
+ The Turán number for the edge blow-up of trees: The missing case 2023 Cheng Chi
Long‐Tu Yuan
+ PDF Chat On Turán’s theorem for sparse graphs 1981 Miklós Ajtai
Paul Erdős
János Komlós
Endre Szemerédi
+ On the Turán Number of Theta Graphs 2021 Mingqing Zhai
Longfei Fang
Jinlong Shu
+ On cliques in isoregular graphs 2011 A. A. Makhnëv
+ On clique-complete graphs 1998 Cláudio L. Lucchesi
Célia Picinin de Mello
Jayme L. Szwarcfiter
+ On cliques and bicliques 2017 M.A. Pizaña
I.A. Robles
+ LOWER BOUND NUMBER OF IRREDUCIBLE GRAPHS ON SURMCES 1998 刘莹
刘彦佩

Works That Cite This (0)

Action Title Year Authors