Related papers: Bounds on some edge Folkman numbers
We improve the previuosly known bound for some vertex Folkman numbers.
In this paper we discuss a class of combinatorial constants in Ramsey theory- edge Folkman numbers. We give an upper bound on one of them- the number F_e(3,3,3;13).
In this paper we prove that the edge Folkman number Fe(3,5;13) is not greater than 21.
In the paper we give a lower bound for the number of vertices of a given graph using its chromatic number. We find the graphs for which this bound is exact. The results are applied in the theory of Foklman numbers.
We present some new constructive upper bounds based on product graphs for generalized vertex Folkman numbers. They lead to new upper bounds for some special cases of generalized edge Folkman numbers, including $F_e(K_3,K_4-e; K_5) \leq 27$…
In this paper we prove a new upper bouhd on an edge Folkman number. In a previous paper we have proved that this bound is exact.
We give a new recurrent inequality on a class of vertex Folkman numbers.
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
In this paper several Folkman numbers are computed.
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We survey some results on toric topology.
We survey the known results regarding the boundaries of word-hyperbolic groups.
We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.
In the paper, some lower bounds for polygamma functions are refined.
We give (1) an upper bound on the denominators of numerical boundary slopes and (2) an upper bound on the differences between two numerical boundary slopes, for Montesinos knot exteriors.
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.
This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.
For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.