RO EN
A remark on the weak Turán’s TheoremAt the request of the author (Received October 21, 2019), the article has been retracted.
Authors: Nader Jafari Rad
Keywords: Independent set, Tur$\acute{a}$n's Theorem, Probabilistic methods.
– 0.07 Mb
Keywords: Independent set, Tur$\acute{a}$n's Theorem, Probabilistic methods.
Abstract
A subset $S$ of vertices of a graph $G$ is an \textit{independent set} if no pair of vertices of $S$ are adjacent. The \textit{independence number}, $\alpha(G)$ of $G$, is the maximum cardinality of an independent set of $G$. In this note, we present an improvement of the weak Tur$\acute{a}$n's theorem.Department of Mathematics, Shahrood University of Technology
Shahrood, Iran
E-mail:
Shahrood, Iran
E-mail:
Fulltext
– 0.07 Mb
Contents
- Choice Numbers of Multi-Bridge Graphs
- A remark on the weak Turán’s Theorem
At the request of the author (Received October 21, 2019), the article has been retracted.
- On the locating matrix of a graph and its spectral analysis
- Computing Comprehensive Gröbner Systems: A Comparison of Two Methods
- Stability Analysis of Efficient Portfolios in a Discrete Variant of Multicriteria Investment Problem with Savage's Risk Criteria
- A linear model for multidimensional Big Data visualization
- Non-commutative finite associative algebras of 2-dimension vectors
