Displaying similar documents to “On Lee's conjecture and some results”

Nonempty intersection of longest paths in a graph with a small matching number

Fuyuan Chen (2015)

Czechoslovak Mathematical Journal

Similarity:

A maximum matching of a graph G is a matching of G with the largest number of edges. The matching number of a graph G , denoted by α ' ( G ) , is the number of edges in a maximum matching of G . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture...

A class of permutation trinomials over finite fields

Xiang-dong Hou (2014)

Acta Arithmetica

Similarity:

Let q > 2 be a prime power and f = - x + t x q + x 2 q - 1 , where t * q . We prove that f is a permutation polynomial of q ² if and only if one of the following occurs: (i) q is even and T r q / 2 ( 1 / t ) = 0 ; (ii) q ≡ 1 (mod 8) and t² = -2.

On a number theoretic conjecture on positive integral points in a 5-dimensional tetrahedron and a sharp estimate of the Dickman–De Bruijn function

Ke-Pao Lin, Xue Luo, Stephen S.-T. Yau, Huaiqing Zuo (2014)

Journal of the European Mathematical Society

Similarity:

It is well known that getting the estimate of integral points in right-angled simplices is equivalent to getting the estimate of Dickman-De Bruijn function ψ ( x , y ) which is the number of positive integers x and free of prime factors > y . Motivating from the Yau Geometry Conjecture, the third author formulated the Number Theoretic Conjecture which gives a sharp polynomial upper estimate that counts the number of positive integral points in n-dimensional ( n 3 ) real right-angled simplices. In this...

On the Brocard-Ramanujan problem and generalizations

Andrzej Dąbrowski (2012)

Colloquium Mathematicae

Similarity:

Let p i denote the ith prime. We conjecture that there are precisely 28 solutions to the equation n ² - 1 = p α p k α k in positive integers n and α₁,..., α k . This conjecture implies an explicit description of the set of solutions to the Brocard-Ramanujan equation. We also propose another variant of the Brocard-Ramanujan problem: describe the set of solutions in non-negative integers of the equation n! + A = x₁²+x₂²+x₃² (A fixed).

On a problem concerning k -subdomination numbers of graphs

Bohdan Zelinka (2003)

Czechoslovak Mathematical Journal

Similarity:

One of numerical invariants concerning domination in graphs is the k -subdomination number γ k S - 11 ( G ) of a graph G . A conjecture concerning it was expressed by J. H. Hattingh, namely that for any connected graph G with n vertices and any k with 1 2 n < k n the inequality γ k S - 11 ( G ) 2 k - n holds. This paper presents a simple counterexample which disproves this conjecture. This counterexample is the graph of the three-dimensional cube and k = 5 .

Recent progress on the Jacobian Conjecture

Michiel de Bondt, Arno van den Essen (2005)

Annales Polonici Mathematici

Similarity:

We describe some recent developments concerning the Jacobian Conjecture (JC). First we describe Drużkowski’s result in [6] which asserts that it suffices to study the JC for Drużkowski mappings of the form x + ( A x ) * 3 with A² = 0. Then we describe the authors’ result of [2] which asserts that it suffices to study the JC for so-called gradient mappings, i.e. mappings of the form x - ∇f, with f k [ n ] homogeneous of degree 4. Using this result we explain Zhao’s reformulation of the JC which asserts the...

Determination of a type of permutation trinomials over finite fields

Xiang-dong Hou (2014)

Acta Arithmetica

Similarity:

Let f = a x + b x q + x 2 q - 1 q [ x ] . We find explicit conditions on a and b that are necessary and sufficient for f to be a permutation polynomial of q ² . This result allows us to solve a related problem: Let g n , q p [ x ] (n ≥ 0, p = c h a r q ) be the polynomial defined by the functional equation c q ( x + c ) n = g n , q ( x q - x ) . We determine all n of the form n = q α - q β - 1 , α > β ≥ 0, for which g n , q is a permutation polynomial of q ² .

A note on the independent domination number versus the domination number in bipartite graphs

Shaohui Wang, Bing Wei (2017)

Czechoslovak Mathematical Journal

Similarity:

Let γ ( G ) and i ( G ) be the domination number and the independent domination number of G , respectively. Rad and Volkmann posted a conjecture that i ( G ) / γ ( G ) Δ ( G ) / 2 for any graph G , where Δ ( G ) is its maximum degree (see N. J. Rad, L. Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than Δ ( G ) / 2 are provided as well.

Characterization of the alternating groups by their order and one conjugacy class length

Alireza Khalili Asboei, Reza Mohammadyari (2016)

Czechoslovak Mathematical Journal

Similarity:

Let G be a finite group, and let N ( G ) be the set of conjugacy class sizes of G . By Thompson’s conjecture, if L is a finite non-abelian simple group, G is a finite group with a trivial center, and N ( G ) = N ( L ) , then L and G are isomorphic. Recently, Chen et al. contributed interestingly to Thompson’s conjecture under a weak condition. They only used the group order and one or two special conjugacy class sizes of simple groups and characterized successfully sporadic simple groups (see Li’s PhD dissertation)....

Domination and independence subdivision numbers of graphs

Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The domination subdivision number s d γ ( G ) of a graph is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number. Arumugam showed that this number is at most three for any tree, and conjectured that the upper bound of three holds for any graph. Although we do not prove this interesting conjecture, we give an upper bound for the domination subdivision number for any graph G in terms of the minimum degrees of...

On choosability of complete multipartite graphs K 4 , 3 * t , 2 * ( k - 2 t - 2 ) , 1 * ( t + 1 )

Guo-Ping Zheng, Yu-Fa Shen, Zuo-Li Chen, Jin-Feng Lv (2010)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is said to be chromatic-choosable if ch(G) = χ(G). Ohba has conjectured that every graph G with 2χ(G)+1 or fewer vertices is chromatic-choosable. It is clear that Ohba’s conjecture is true if and only if it is true for complete multipartite graphs. In this paper we show that Ohba’s conjecture is true for complete multipartite graphs K 4 , 3 * t , 2 * ( k - 2 t - 2 ) , 1 * ( t + 1 ) for all integers t ≥ 1 and k ≥ 2t+2, that is, c h ( K 4 , 3 * t , 2 * ( k - 2 t - 2 ) , 1 * ( t + 1 ) ) = k , which extends the results c h ( K 4 , 3 , 2 * ( k - 4 ) , 1 * 2 ) = k given by Shen et al. (Discrete Math. 308 (2008) 136-143), and c h ( K 4 , 3 * 2 , 2 * ( k - 6 ) , 1 * 3 ) = k ...

The generalized Hodge and Bloch conjectures are equivalent for general complete intersections

Claire Voisin (2013)

Annales scientifiques de l'École Normale Supérieure

Similarity:

We prove that Bloch’s conjecture is true for surfaces with p g = 0 obtained as 0 -sets X σ of a section σ of a very ample vector bundle on a variety X with “trivial” Chow groups. We get a similar result in presence of a finite group action, showing that if a projector of the group acts as 0 on holomorphic 2 -forms of  X σ , then it acts as 0 on  0 -cycles of degree 0 of  X σ . In higher dimension, we also prove a similar but conditional result showing that the generalized Hodge conjecture for general X σ ...