共查询到20条相似文献,搜索用时 812 毫秒
1.
《Discrete Mathematics》2022,345(11):113029
Let G be a k-connected graph on n vertices. Hippchen's Conjecture (2008) states that two longest paths in G share at least k vertices. Gutiérrez (2020) recently proved the conjecture when or . We improve upon both results; namely, we show that two longest paths in G share at least k vertices when or . This completely resolves two conjectures by Gutiérrez in the affirmative. 相似文献
2.
《Discrete Mathematics》2022,345(12):113078
Let G be a simple connected graph and let be the sum of the first k largest Laplacian eigenvalues of G. It was conjectured by Brouwer in 2006 that holds for . The case was proved by Haemers, Mohammadian and Tayfeh-Rezaie [Linear Algebra Appl., 2010]. In this paper, we propose the full Brouwer's Laplacian spectrum conjecture and we prove the conjecture holds for which also confirm the conjecture of Guan et al. in 2014. 相似文献
3.
Md. Ali Zinna 《Journal of Pure and Applied Algebra》2019,223(2):783-793
Let R be a commutative Noetherian ring of dimension two with and let . Let P be a projective A-module of rank 2. In this article, we prove that P is cancellative if is cancellative. 相似文献
4.
Julia Semikina 《Journal of Pure and Applied Algebra》2019,223(10):4509-4523
I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group , but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for for any finite group G. Furthermore, we prove that for any degree other than the conjecture gives a correct prediction for the rank of . 相似文献
5.
6.
A -partite tournament is an orientation of a complete -partite graph. In 2006, Volkmann conjectured that every arc of a regular 3-partite tournament is contained in an -, - or -cycle for each , and this conjecture was proved to be correct for . In 2012, Xu et al. conjectured that every arc of an -regular 3-partite tournament with is contained in a - or -cycle for . They proved that this conjecture is true for . In this paper, we confirm this conjecture for , which also implies that Volkmann’s conjecture is correct for . 相似文献
7.
8.
Yuchen Ding 《Comptes Rendus Mathematique》2019,357(6):483-486
Assuming the abc conjecture, Silverman proved that, for any given positive integer , there are primes such that . In this paper, we show that, for any given integers and , there still are primes satisfying and , under the assumption of the abc conjecture. This improves a recent result of Chen and Ding. 相似文献
9.
Sarah Mayes-Tang 《Journal of Pure and Applied Algebra》2019,223(2):571-579
Given an ideal I we investigate the decompositions of Betti diagrams of the graded family of ideals formed by taking powers of I. We prove conjectures of Engström from [5] and show that there is a stabilization in the Boij–Söderberg decompositions of for when I is a homogeneous ideal with generators in a single degree. In particular, the number of terms in the decompositions with positive coefficients remains constant for , the pure diagrams appearing in each decomposition have the same shape, and the coefficients of these diagrams are given by polynomials in k. We also show that a similar result holds for decompositions with arbitrary coefficients arising from other chains of pure diagrams. 相似文献
10.
11.
A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty–Simon conjecture, states that any diameter-2-critical graph of order has at most edges, with equality if and only if is a balanced complete bipartite graph. Many partial results about this conjecture have been obtained, in particular it is known to hold for all sufficiently large graphs, for all triangle-free graphs, and for all graphs with a dominating edge. In this paper, we discuss ways in which this conjecture can be strengthened. Extending previous conjectures in this direction, we conjecture that, when we exclude the class of complete bipartite graphs and one particular graph, the maximum number of edges of a diameter-2-critical graph is at most . The family of extremal examples is conjectured to consist of certain twin-expansions of the 5-cycle (with the exception of a set of thirteen special small graphs). Our main result is a step towards our conjecture: we show that the Murty–Simon bound is not tight for non-bipartite diameter-2-critical graphs that have a dominating edge, as they have at most edges. Along the way, we give a shorter proof of the Murty–Simon conjecture for this class of graphs, and stronger bounds for more specific cases. We also characterize diameter-2-critical graphs of order with maximum degree : they form an interesting family of graphs with a dominating edge and edges. 相似文献
12.
13.
We characterize all finite metabelian 2-groups G whose abelianizations are of type , with , and for which their commutator subgroups have . This is given in terms of the order of the abelianizations of the maximal subgroups and the structure of the abelianizations of those normal subgroups of index 4 in G. We then translate these group theoretic properties to give a characterization of number fields k with 2-class group , , such that the rank of where is the Hilbert 2-class field of k. In particular, we apply all this to real quadratic number fields whose discriminants are a sum of two squares. 相似文献
14.
15.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
16.
17.
18.
19.
Let be a Noetherian local ring and M a finitely generated R-module. The invariants and of M were introduced in [3] and [17] in order to measure the non-Cohen–Macaulayness and the non-sequential-Cohen–Macaulayness of M, respectively. Let be the filtration of M such that is the largest submodule of M of dimension less than for all and . In this paper we prove that if , then there exists a constant c such that for all good parameter ideals of M with respect to this filtration. Here is the reducibility index of on M. This is an extension of the main results of [19], [20], [24]. 相似文献
20.
Let be the -color Ramsey number of an odd cycle of length . It is shown that for each fixed , for all sufficiently large , where is a constant. This improves an old result by Bondy and Erd?s (1973). 相似文献