Cover Image

Turán number of four vertex-disjoint cliques

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kostochka, Alexandr, Peng, Dadong, Zhang, Liang
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C35 (primary) 05C75 (secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved bound of graph energy in terms of vertex cover number
by: Samanta, Aniruddha
Published: (2025)

Spanning Components and Surfaces Under Minimum Vertex Degree
by: Allsop, Jack, et al.
Published: (2025)

On the average size of $1$-nearly independent vertex sets in graphs
by: Dossou-Olory, Audace A. V., et al.
Published: (2025)

Symmetric Union Closed Families
by: M, Nived J
Published: (2024)

Chain Tutte polynomials
by: Wakefield, Max
Published: (2023)

Bicyclic graphs with the smallest and largest numbers of connected sets
by: Dossou-Olory, Audace A. V.
Published: (2026)

Upper bounds on the odd graceful chromatic number of graphs
by: Afifurrahman, Muhammad, et al.
Published: (2025)

Exact Turán numbers of two vertex-disjoint paths
by: Dong, Miao, et al.
Published: (2025)

Hypercube Embeddings And Median Structure In The Intersection Lattice Of Discriminantal Arrangements B(n,k)
by: Das, Pragnya
Published: (2026)

Rigidity of symmetric frameworks with non-free group actions on the vertices
by: La Porta, Alison, et al.
Published: (2024)

Artin-Ihara L-functions for hypergraphs
by: Eyler, Mason, et al.
Published: (2023)

Board games, random boards and long boards
by: Shaviv, Ary
Published: (2021)

On Relative Ordered Turán Density
by: King, Dylan, et al.
Published: (2025)

Random Walks and the Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Random Walks and the Best Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Chain characteristic polynomials of matroids
by: Lazzaro, Gary, et al.
Published: (2025)

A polynomial algorithm to compute the boxicity and threshold dimension of complements of block graphs
by: Caoduro, Marco, et al.
Published: (2025)

Matrices with simple symmetric digraphs and their group inverses
by: Nandi, Raju
Published: (2023)

A Classification of Graphs through Quadratic Embedding Constants and Clique Graph Insights
by: Baskoro, Edy Tri, et al.
Published: (2023)

Infinite grids in digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Bi-eulerian embeddings of graphs and digraphs
by: Ellingham, M. N., et al.
Published: (2024)

A coarse Tutte polynomial for hypermaps
by: Ellis-Monaghan, Joanna A., et al.
Published: (2024)

A Critical Probability for Biclique Partition of $G_{n,p}$
by: Bohman, Tom, et al.
Published: (2022)

Generalized spectral Turán problems for disjoint cliques
by: Xu, Yi, et al.
Published: (2026)

Sets and partitions minimising small differences
by: Antoniuk, Sylwia, et al.
Published: (2024)

Sharp Thresholds for Factors in Random Graphs
by: Burghart, Fabian, et al.
Published: (2024)

A Note on Turán Numbers and the Erdős-Stone-Simonovits Theorem
by: Gobej, Stefan
Published: (2025)

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

The hitting time of nice factors
by: Burghart, Fabian, et al.
Published: (2024)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

Sharp thresholds for NAC-colourings and stable cuts in random graphs
by: Clinch, Katie, et al.
Published: (2025)

Generic infinitesimal rigidity for rotational groups in the plane
by: La Porta, Alison, et al.
Published: (2024)

Universal updates of Dyck-nest signatures
by: Dejter, Italo J.
Published: (2022)

Flexible DP 3-coloring of sparse multigraphs
by: Bradshaw, Peter, et al.
Published: (2025)

Ore-type conditions for existence of a jellyfish in a graph
by: Kim, Jaehoon, et al.
Published: (2024)

Further Results on the Quadratic Embedding Constants of Corona Graphs
by: Ferdi, et al.
Published: (2026)

Age-dependent random connection models with arc reciprocity: clustering and connectivity
by: Lüchtrath, Lukas, et al.
Published: (2026)

Some Combinatorial Formulas Related to Diagonal Ramsey Numbers
by: Jiradilok, Pakawut
Published: (2024)

The Defective Parking Space and Defective Kreweras Numbers
by: Garcia, Rebecca E., et al.
Published: (2024)