共查询到20条相似文献,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(1):112669
In this paper, we consider two kinds of spectral extremal questions. The first asks which graph attains the maximum Q-index over all graphs of order n and size ? The second asks which graph attains the maximum Q-index over all -bipartite graphs with edges? We solve the first question for , and the second question for . The maximum Q-index on connected -bipartite graphs is also determined for . 相似文献
2.
3.
The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic polynomial time algorithm for the m-th moment k-subset sum problem over finite fields for each fixed m when the evaluation set is the image set of a monomial or Dickson polynomial of any degree n. In the classical case , this recovers previous results of Nguyen-Wang (the case ) [22] and the results of Choe-Choe (the case ) [3]. 相似文献
4.
5.
《Discrete Mathematics》2020,343(10):111996
A Gallai coloring of a complete graph is an edge coloring without triangles colored with three different colors. A sequence of positive integers is an -sequence if . An -sequence is a G-sequence if there is a Gallai coloring of with colors such that there are edges of color for all . Gyárfás, Pálvölgyi, Patkós and Wales proved that for any integer there exists an integer such that every -sequence is a G-sequence if and only if . They showed that and .We show that and give almost matching lower and upper bounds for by showing that with suitable constants , for all sufficiently large . 相似文献
6.
7.
8.
9.
11.
Without the restriction of quadratic form as a Riemannian metric, a Finsler metric on a smooth manifold M can be reversible (symmetric in y) or not. Reversible Finsler metrics have different properties from Riemannian metrics though it seems they are very close to Riemannian metrics. Hilbert metric is the famous reversible Finsler metric of negative constant flag curvature in the history, and it is projectively flat. Then it is natural to ask the question how to classify reversible projectively flat Finsler metrics of constant flag curvature and give more new examples? In this paper, we answer the above question by giving the classification when the flag curvature respectively. Especially, for the case when , we show that the only reversible projectively flat Finsler metrics are just Hilbert metrics. For the case when , we give an algebraic way to construct explicit metric function by solving algebraic equations, such as by solving a quartic equation. When the flag curvature is zero, it is much easier to construct reversible projectively flat Finsler metrics than before. 相似文献
12.
《Discrete Mathematics》2022,345(8):112904
Let be the minimum integer such that every plane graph with girth g at least , minimum degree and no -paths consisting of vertices of degree 2, where , has a 3-vertex with at least t neighbors of degree 2, where .In 2015, Jendrol' and Maceková proved . Later on, Hudák et al. established , Jendrol', Maceková, Montassier, and Soták proved , and , and we recently proved that and .Thus is already known for and all t. In this paper, we prove that , , and whenever . 相似文献
13.
《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. 相似文献
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 . 相似文献
17.
《Discrete Mathematics》2022,345(4):112774
Chvátal and Erdös (1972) [5] proved that, for a k-connected graph G, if the stability number , then G is Hamilton-connected () or Hamiltonian () or traceable (). Motivated by the result, we focus on tight sufficient spectral conditions for k-connected graphs to possess Hamiltonian s-properties. We say that a graph possesses Hamiltonian s-properties, which means that the graph is Hamilton-connected if , Hamiltonian if , and traceable if .For a real number , and for a k-connected graph G with order n, degree diagonal matrix and adjacency matrix , we have identified best possible upper bounds for the spectral radius , where Γ is either G or the complement of G, to warrant that G possesses Hamiltonian s-properties. Sufficient conditions for a graph G to possess Hamiltonian s-properties in terms of upper bounds for the Laplacian spectral radius as well as lower bounds of the algebraic connectivity of G are also obtained. Other best possible spectral conditions for Hamiltonian s-properties are also discussed. 相似文献
18.
19.
20.
《Indagationes Mathematicae》2022,33(6):1263-1296
We study the -th moment of central values of the family of primitive cubic and quartic Dirichlet -functions. We establish sharp lower bounds for all real unconditionally for the cubic case and under the Lindelöf hypothesis for the quartic case. We also establish sharp lower bounds for all real and sharp upper bounds for all real for both the cubic and quartic cases under the generalized Riemann hypothesis (GRH). As an application of our results, we establish quantitative non-vanishing results for the corresponding -values. 相似文献