A generalization of a Turán’s theorem about maximum clique on graphs
| Main Authors: | Santiago, Douglas Frederico Guimarães; Institute of Science and Technology (ICT), Federal University of the Jequinhonha and Mucuri Valleys, Diamantina, Brazil, Porto, Anderson Luiz Pedrosa; Institute of Science and Technology (ICT), Federal University of the Jequinhonha and Mucuri Valleys, Diamantina, Brazil, Sá, Kaio Ariel Silva; Institute of Science and Technology (ICT), Federal University of the Jequinhonha and Mucuri Valleys, Diamantina, Brazil |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1329 https://www.ejgta.org/index.php/ejgta/article/view/1329/pdf_234 https://www.ejgta.org/index.php/ejgta/article/downloadSuppFile/1329/327 |
Daftar Isi:
- One of the most important Turán’s theorems establishes an inequality between the maximum clique and the number of edges of a graph. Since 1941, this result has received much attention and many of the different proofs involve induction and a probability distribution. In this paper we detail finite procedures that gives a proof for the Turán’s Theorem. Among other things, we give a generalization of this result. Also we apply this results to a Nikiforov’s inequality between the spectral radius and the maximum clique of a graph.