On a conjecture about monochromatic flats
✍ Scribed by Yanling Yang
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 257 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n-vertex graph G is said to be hypoenergetic if E(G) < n. In Gutman et al. (2008) [14] the authors conjectured that there exist n-vertex hypoenergetic trees with maximum degree ∆ = 4 for any n ≡ 2 mod 4, n > 2
The Lotka-Volterra system of autonomous di erential equations consists in three homogeneous polynomial equations of degree 2 in three variables. This system, or the corresponding vector ÿeld LV (A; B; C), depends on three non-zero (complex) parameters and may be written as LV (A; B; C) = Vx@x + Vy@y
## Abstract As our main result, we prove that for every multigraph __G__ = (__V, E__) which has no loops and is of order __n__, size __m__, and maximum degree $\Delta < {{{10}}^{-{{3}}}{{m}}\over \sqrt{{{8}}{{n}}}}$ there is a mapping ${{f}}:{{V}}\cup {{E}}\to \big\{{{1}},{{2}},\ldots,\big\lceil{{{
Let N be the set of positive integers, B ¼ fb 1 5 . . . 5b k g & N, N 2 N, and N5b k . For i ¼ 0 or 1, A ¼ A i ðB; NÞ is the set (introduced by Nicolas, Ruzsa, and Sa´rko¨zy, J. Number Theory 73 (1998), 292-317) such that A \ f1; . . . ; Ng ¼ B and pðA; nÞ iðmod2Þ for n 2 N; n4N, where pðA; nÞ denot