For every n-vertex graph G, the 4-clique cover number of G is at most that of the Turán graph T_{n,4}, confirming the t=4 case of the Dau-Milenkovic-Puleo conjecture.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the $4$-clique cover number of graphs
For every n-vertex graph G, the 4-clique cover number of G is at most that of the Turán graph T_{n,4}, confirming the t=4 case of the Dau-Milenkovic-Puleo conjecture.