A Proof of Brouwer's Toughness Conjecture
نویسندگان
چکیده
The toughness $t(G)$ of a connected graph $G$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum taken over all proper subsets $S\subset V(G)$ such that $c(G-S)>1$, where $c(G-S)$ denotes number components $G-S$. Let $\lambda$ denote second largest absolute eigenvalue adjacency matrix graph. For any $d$-regular $G$, it has been shown by Alon $t(G)>\frac{1}{3}(\frac{d^2}{d\lambda+\lambda^2}-1)$, through which, was able to show for every $t$ and $g$ there are $t$-tough graphs girth strictly greater than $g$, thus disproved strong sense conjecture Chv\'atal on pancyclicity. Brouwer independently discovered better bound $t(G)>\frac{d}{\lambda}-2$ while he also conjectured lower can be improved $t(G)\ge \frac{d}{\lambda} - 1$. We confirm this conjecture.
منابع مشابه
Partial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملA Proof of Feigin’s Conjecture
Ext ∞ 2 +• A (C, ·) was given. The setup for the definition of semiinfinite cohomology of an algebra A includes two subalgebras B,N ⊂ A and the triangular decomposition of A, i. e. the vector space isomorphism B⊗N−̃→A provided by the multiplication in A. Fix root data (Y,X, . . . ) of the finite type (I, ·) and a positive integer number l. The small quantum group ul with the standard triangular ...
متن کاملA proof of Dejean's conjecture
We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of n, namely 15 ≤ n ≤ 26.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1372652