共查询到20条相似文献,搜索用时 15 毫秒
1.
In 2009, Kyaw proved that every -vertex connected -free graph with contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected -free graphs. We show that every -vertex connected -free graph with contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “” is best possible. 相似文献
2.
Charles Almeida Aline V. Andrade Rosa M. Miró-Roig 《Journal of Pure and Applied Algebra》2019,223(4):1817-1831
Let be a minimal monomial Togliatti system of forms of degree d. In [4], Mezzetti and Miró-Roig proved that the minimal number of generators of lies in the interval . In this paper, we prove that for and , the integer values in cannot be realized as the number of minimal generators of a minimal monomial Togliatti system. We classify minimal monomial Togliatti systems of forms of degree d with or 3n (i.e. with the minimal number of generators reaching the border of the non-existence interval). Finally, we prove that for , and there exists a minimal monomial Togliatti system of forms of degree d with . 相似文献
3.
4.
5.
In the papers (Benoumhani 1996;1997), Benoumhani defined two polynomials and . Then, he defined and to be the polynomials satisfying and . In this paper, we give a combinatorial interpretation of the coefficients of and prove a symmetry of the coefficients, i.e., . We give a combinatorial interpretation of and prove that is a polynomial in with non-negative integer coefficients. We also prove that if then all coefficients of except the coefficient of are non-negative integers. For all , the coefficient of in is , and when some other coefficients of are also negative. 相似文献
6.
Let represent the minimum number of complete -partite -graphs required to partition the edge set of the complete -uniform hypergraph on vertices. The Graham–Pollak theorem states that . An upper bound of was known. Recently this was improved to for even . A bound of was also proved recently. Let be the limit of as . The smallest odd for which that was known was for . In this note we improve this to and also give better upper bounds for , for small values of even . 相似文献
7.
In 1996, Cox and Rodger [Cycle systems of the line graph of the complete graph, J. Graph Theory 21 (1996) 173–182] raised the following question: For what values of and does there exist an -cycle decomposition of In this paper, the above question is answered for In fact, it is shown that the -fold line graph of the complete graph has a -decomposition if and only if and 相似文献
8.
9.
For given graphs , , the -color Ramsey number, denoted by , is the smallest integer such that if we arbitrarily color the edges of a complete graph of order with colors, then it always contains a monochromatic copy of colored with , for some . Let be a cycle of length and a star of order . In this paper, firstly we give a general upper bound of . In particular, for the 3-color case, we have and this bound is tight in some sense. Furthermore, we prove that for all and , and if is a prime power, then the equality holds. 相似文献
10.
11.
The tensor product of graphs , and is defined by and Let be the fractional chromatic number of a graph . In this paper, we prove that if one of the three graphs , and is a circular clique, 相似文献
12.
13.
A graph is -colorable if it admits a vertex partition into a graph with maximum degree at most and a graph with maximum degree at most . We show that every -free planar graph is -colorable. We also show that deciding whether a -free planar graph is -colorable is NP-complete. 相似文献
14.
Alexander Iksanov Konrad Kolesko Matthias Meiners 《Stochastic Processes and their Applications》2019,129(11):4480-4499
Let be Biggins’ martingale associated with a supercritical branching random walk, and let be its almost sure limit. Under a natural condition for the offspring point process in the branching random walk, we show that if the law of belongs to the domain of normal attraction of an -stable distribution for some , then, as , there is weak convergence of the tail process , properly normalized, to a random scale multiple of a stationary autoregressive process of order one with -stable marginals. 相似文献
15.
《Discrete Mathematics》2022,345(9):112977
Consider functions , where A and C are disjoint finite sets. The weakly connected components of the digraph of such a function are cycles of rooted trees, as in random mappings, and isolated rooted trees. Let and . When a function is chosen from all possibilities uniformly at random, then we find the following limiting behaviour as . If , then the size of the maximal mapping component goes to infinity almost surely; if , a constant, then process counting numbers of mapping components of different sizes converges; if , then the number of mapping components converges to 0 in probability. We get estimates on the size of the largest tree component which are of order when and constant when , . These results are similar to ones obtained previously for random injections, for which the weakly connected components are cycles and linear trees. 相似文献
16.
17.
Let be the finite field of order q. Let G be one of the three groups , or and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials such that for all cases except when and or . 相似文献
18.
Let be a simple connected graph with vertices and edges. The spectral radius of is the largest eigenvalue of its adjacency matrix. In this paper, we firstly consider the effect on the spectral radius of a graph by removing a vertex, and then as an application of the result, we obtain a new sharp upper bound of which improves some known bounds: If , where is an integer, then The equality holds if and only if is a complete graph or , where is the graph obtained from by deleting some edge . 相似文献
19.
20.