Class number 2 problem for certain real quadratic fields of Richaud-Degert type

In this paper we will apply Biró's method in [A. Biró, Yokoi's conjecture, Acta Arith. 106 (2003) 85-104; A. Biró, Chowla's conjecture, Acta Arith. 107 (2003) 179-194] to class number 2 problem of real quadratic fields of Richaud-Degert type and will show that there are exactly 4 real quadratic fields of the form with class number 2, where n²+1 is a even square free integer.     

On 2-factors with k components

In this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-factor with k components. By proving a conjecture of Faudree et al. [A note on 2-factors with two components, Discrete Math. 300 (2005) 218-224] we show the following. There exists a real number ε>0 such that for every integer k?2 there exists an integer n₀=n₀(k) such that every Hamiltonian graph G of order n?n₀ with has a 2-factor with k components.     

Estimates for eigenvalues on Riemannian manifolds

In this paper, we investigate eigenvalues of the Dirichlet eigenvalue problem of Laplacian on a bounded domain Ω in an n-dimensional complete Riemannian manifold M. When M is an n-dimensional Euclidean space Rn, the conjecture of Pólya is well known: the kth eigenvalue λk of the Dirichlet eigenvalue problem of Laplacian satisfies

     

On the Turán number for the hexagon

A long-standing conjecture of Erd?s and Simonovits is that ex(n,C_2k), the maximum number of edges in an n-vertex graph without a 2k-gon is asymptotically as n tends to infinity. This was known almost 40 years ago in the case of quadrilaterals. In this paper, we construct a counterexample to the conjecture in the case of hexagons. For infinitely many n, we prove that

     

Pósa-condition and nowhere-zero 3-flows

Let G be a simple graph on n vertices and π(G)=(d₁,d₂,…,d_n) be the degree sequence of G, where n≥3 and d₁≤d₂≤?≤d_n. The classical Pósa’s theorem states that if d_m≥m+1 for and d_m+1≥m+1 for n being odd and , then G is Hamiltonian, which implies that G admits a nowhere-zero 4-flow. In this paper, we further show that if G satisfies the Pósa-condition that d_m≥m+1 for and d_m+1≥m+1 for n being odd and , then G has no nowhere-zero 3-flow if and only if G is one of seven completely described graphs.     

Spectral radius and Hamiltonicity of graphs

Let G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let be the complement of G.Write K_n-1+v for the complete graph on n-1 vertices together with an isolated vertex, and K_n-1+e for the complete graph on n-1 vertices with a pendent edge.We show that:If μ(G)?n-2, then G contains a Hamiltonian path unless G=K_n-1+v; if strict inequality holds, then G contains a Hamiltonian cycle unless G=K_n-1+e.If , then G contains a Hamiltonian path unless G=K_n-1+v.If , then G contains a Hamiltonian cycle unless G=K_n-1+e.     

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

In this paper, we prove that directed cyclic Hamiltonian cycle systems of the complete symmetric digraph, , exist if and only if n is odd with n≠15 and n≠p^α for p an odd prime and α≥2 or with n≠2p^α for p an odd prime and α≥1. We also show that directed cyclic Hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (K_n−I)^∗, exist if and only if .     

Disjoint unions of complete minors

Given integers r and s, and n large compared to r and s, we determine the maximum size of a graph of order n having no minor isomorphic to sK_r, the union of s disjoint copies of K_r.The extremal function depends on the relative sizes of r and s. If s is small compared to r the extremal function is essentially independent of s. On the other hand, if s is large compared to r, there is a unique extremal graph ; this assertion is a generalization of the case r=3 which is a classical result of Erd?s and Pósa.     

On a conjecture of Erd?s, Graham and Spencer, II

It is conjectured by Erd?s, Graham and Spencer that if 1≤a₁≤a₂≤?≤a_s are integers with , then this sum can be decomposed into n parts so that all partial sums are ≤1. This is not true for as shown by a₁=?=a_n−2=1, . In 1997 Sandor proved that Erd?s-Graham-Spencer conjecture is true for . Recently, Chen proved that the conjecture is true for . In this paper, we prove that Erd?s-Graham-Spencer conjecture is true for .     

Homology of dihedral quandles

We solve the conjecture by R. Fenn, C. Rourke and B. Sanderson that the rack homology of dihedral quandles satisfies for p odd prime [T. Ohtsuki, Problems on invariants of knots and 3-manifolds, Geom. Topol. Monogr. 4 (2002) 377-572, Conjecture 5.12]. We also show that contains Z_p for n≥3. Furthermore, we show that the torsion of is annihilated by 3. We also prove that the quandle homology contains Z_p for p odd prime. We conjecture that for n>1 quandle homology satisfies: , where f_n are “delayed” Fibonacci numbers, that is, f_n=f_n−1+f_n−3 and f(1)=f(2)=0,f(3)=1. Our paper is the first step in approaching this conjecture.     

Noncrossing Hamiltonian paths in geometric graphs

A geometric graph is a graph embedded in the plane in such a way that vertices correspond to points in general position and edges correspond to segments connecting the appropriate points. A noncrossing Hamiltonian path in a geometric graph is a Hamiltonian path which does not contain any intersecting pair of edges. In the paper, we study a problem asked by Micha Perles: determine the largest number h(n) such that when we remove any set of h(n) edges from any complete geometric graph on n vertices, the resulting graph still has a noncrossing Hamiltonian path. We prove that . We also establish several results related to special classes of geometric graphs. Let h₁(n) denote the largest number such that when we remove edges of an arbitrary complete subgraph of size at most h₁(n) from a complete geometric graph on n vertices the resulting graph still has a noncrossing Hamiltonian path. We prove that . Let h₂(n) denote the largest number such that when we remove an arbitrary star with at most h₂(n) edges from a complete geometric graph on n vertices the resulting graph still has a noncrossing Hamiltonian path. We show that h₂(n)=⌈n/2⌉-1. Further we prove that when we remove any matching from a complete geometric graph the resulting graph will have a noncrossing Hamiltonian path.     

Polynomials over ordered fields

In this paper we determine which polynomials over ordered fields have multiples with nonnegative coefficients and also which polynomials can be written as quotients of two polynomials with nonnegative coefficients. This problem is related to a result given by Pólya in [G.H. Hardy, J.E. Littlewood, G. Pólya, Inequalities, Cambridge University Press, Cambridge, England, 1952] (as a companion of Artin’s theorem) that asserts that if F(X₁,…,X_n)∈R[X₁,…,X_n] is a form (i.e., a homogeneous polynomial) s.t.  with ∑x_j>0, then F=G/H, where G,H are forms with all coefficients positive (i.e., every monomial of degree degG or degH appears in G or H, resp., with a coefficient that is strictly positive). In Pólya’s proof H is chosen to be H=(X₁+?+X_n)^m for some m.At the end we give some applications, including a generalization of Pólya’s result to arbitrary ordered fields.     

Tauberian conditions under which the original convergence of double sequences follows from the statistical convergence of their weighted means

In this paper, we introduce a new type of slow oscillation and slow decrease conditions. We prove that these or their variants are Tauberian conditions from to smn→s. We also prove that they are Tauberian conditions from to smn→s, where are the weighted means of the double sequence . Our results not only generalize well-known results, but also solve the conjecture of Móricz posed in [F. Móricz, Tauberian theorems for double sequences that are statistically summable (C,1,1), J. Math. Anal. Appl. 286 (2003) 340-350].     

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs

Suppose that 0<η<1 is given. We call a graph, G, on n vertices an η-Chvátal graph if its degree sequence d₁≤d₂≤?≤d_n satisfies: for k<n/2, d_k≤min{k+ηn,n/2} implies d_n−k−ηn≥n−k. (Thus for η=0 we get the well-known Chvátal graphs.) An -algorithm is presented which accepts as input an η-Chvátal graph and produces a Hamiltonian cycle in G as an output. This is a significant improvement on the previous best -algorithm for the problem, which finds a Hamiltonian cycle only in Dirac graphs (δ(G)≥n/2 where δ(G) is the minimum degree in G).     

Locating–dominating codes in paths

Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1], r-locating–dominating codes in paths P_n. They conjectured that if r≥2 is a fixed integer, then the smallest cardinality of an r-locating–dominating code in P_n, denoted by , satisfies for infinitely many values of n. We prove that this conjecture holds. In fact, we show a stronger result saying that for any r≥3 we have for all n≥n_r when n_r is large enough. In addition, we solve a conjecture on location–domination with segments of even length in the infinite path.     

Solution to a conjecture on the maximal energy of bipartite bicyclic graphs

The energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let C_n denote the cycle of order n and the graph obtained from joining two cycles C₆ by a path P_n-12 with its two leaves. Let B_n denote the class of all bipartite bicyclic graphs but not the graph R_a,b, which is obtained from joining two cycles C_a and C_b (a,b≥10 and ) by an edge. In [I. Gutman, D. Vidovi?, Quest for molecular graphs with maximal energy: a computer experiment, J. Chem. Inf. Sci. 41(2001) 1002-1005], Gutman and Vidovi? conjectured that the bicyclic graph with maximal energy is , for n=14 and n≥16. In [X. Li, J. Zhang, On bicyclic graphs with maximal energy, Linear Algebra Appl. 427(2007) 87-98], Li and Zhang showed that the conjecture is true for graphs in the class B_n. However, they could not determine which of the two graphs R_a,b and has the maximal value of energy. In [B. Furtula, S. Radenkovi?, I. Gutman, Bicyclic molecular graphs with the greatest energy, J. Serb. Chem. Soc. 73(4)(2008) 431-433], numerical computations up to a+b=50 were reported, supporting the conjecture. So, it is still necessary to have a mathematical proof to this conjecture. This paper is to show that the energy of is larger than that of R_a,b, which proves the conjecture for bipartite bicyclic graphs. For non-bipartite bicyclic graphs, the conjecture is still open.