A generalization of a Turán’s theorem about maximum clique on graphs
From MaRDI portal
Publication:5054044
DOI10.5614/EJGTA.2022.10.2.10zbMath1499.05330OpenAlexW4308003788WikidataQ114982187 ScholiaQ114982187MaRDI QIDQ5054044
Kaio Ariel Silva Sá, Anderson L. P. Porto, Douglas F. G. Santiago
Publication date: 29 November 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.2.10
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement
- Some Inequalities for the Largest Eigenvalue of a Graph
- A graph theoretical analysis of the number of edges in k-dense graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the theory of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalization of a Turán’s theorem about maximum clique on graphs
