اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA spectral Erdos-Stone-Bollobas theorem
162
0
0.0
(
0
)
تأليف
Vladimir Nikiforov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
قيم البحث
اقرأ أيضاً
In [A polynomial invariant of graphs on orientable surfaces, Proc. Lond. Math. Soc., III Ser. 83, No. 3, 513-531 (2001)] and [A polynomial of graphs on surfaces, Math. Ann. 323, 81-96 (2002)], Bollobas and Riordan generalized the classical Tutte poly
nomial to graphs cellularly embedded in surfaces, i.e. ribbon graphs, thus encoding topological information not captured by the classical Tutte polynomial. We provide a `recipe theorem for their new topological Tutte polynomial, R(G). We then relate R(G) to the generalized transition polynomial Q(G) via a medial graph construction, thus extending the relation between the classical Tutte polynomial and the Martin, or circuit partition, polynomial to ribbon graphs. We use this relation to prove a duality property for R(G) that holds for both oriented and unoriented ribbon graphs. We conclude by placing the results of Chumutov and Pak [The Kauffman bracket and the Bollobas-Riordan polynomial of ribbon graphs, Moscow Mathematical Journal 7(3) (2007) 409-418] for virtual links in the context of the relation between R(G) and Q(R).
We prove that if the spectral radius of a graph G of order n is larger than the spectral radius of the r-partite Turan graph of the same order, then G contains various supergraphs of the complete graph of order r+1. In particular G contains a complet
e r-partite graph of size log n with one edge added to the first part. These results complete a project of Erdos from 1963. We also give corresponding stability results.
We extend the classical stability theorem of Erdos and Simonovits in two directions: first, we allow the order of the forbidden graph to grow as log of order of the host graph, and second, our extremal condition is on the spectral radius of the host graph.
We prove a new duality theorem for the category of precontact algebras which implies the Stone Duality Theorem, its connected version obtained in arXiv:1508.02220v3, 1-44 (to appear in Topology Appl.), the recent duality theorems of Bezhanishvili, G.
, Bezhanishvili, N., Sourabh, S., Venema, Y. and Goldblatt, R. and Grice, M, and some new duality theorems for the category of contact algebras and for the category of complete contact algebras.
In 1972, Erd{o}s - Faber - Lov{a}sz (EFL) conjectured that, if $textbf{H}$ is a linear hypergraph consisting of $n$ edges of cardinality $n$, then it is possible to color the vertices with $n$ colors so that no two vertices with the same color are in
the same edge. In 1978, Deza, Erd{o}s and Frankl had given an equivalent version of the same for graphs: Let $G= bigcup_{i=1}^{n} A_i$ denote a graph with $n$ complete graphs $A_1, A_2,$ $ dots , A_n$, each having exactly $n$ vertices and have the property that every pair of complete graphs has at most one common vertex, then the chromatic number of $G$ is $n$. The clique degree $d^K(v)$ of a vertex $v$ in $G$ is given by $d^K(v) = |{A_i: v in V(A_i), 1 leq i leq n}|$. In this paper we give a method for assigning colors to the graphs satisfying the hypothesis of the Erdos - Faber - Lovasz conjecture using intersection matrix of the cliques $A_i$s of $G$ and clique degrees of the vertices of $G$. Also, we give theoretical proof of the conjecture for some class of graphs. In particular we show that: 1. If $G$ is a graph satisfying the hypothesis of the Conjecture 1.2 and every $A_i$ ($1 leq i leq n$) has at most $sqrt{n}$ vertices of clique degree greater than 1, then $G$ is $n$-colorable. 2. If $G$ is a graph satisfying the hypothesis of the Conjecture 1.2 and every $A_i$ ($1 leq i leq n$) has at most $left lceil {frac{n+d-1}{d}} right rceil$ vertices of clique degree greater than or equal to $d$ ($2leq d leq n$), then $G$ is $n$-colorable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
