Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On Fully Split Lacunary Polynomials in Finite Fields

100%

Bibak K., Shparlinski I.

Bulletin of the Polish Academy of Sciences. Mathematics

2011

tom 59

nr 3

197-202

We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs

81%

Nowbandegani P. S., Esfandiari H., Haghighi M. H. S., Bibak K.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 3

635-640

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs

Ograniczanie wyników

1 Bulletin of the Polish Academy of Sciences. Mathematics

1 Discussiones Mathematicae Graph Theory

2 Bibak K.

1 Esfandiari H.

1 Haghighi M. H. S.

1 Nowbandegani P. S.

1 Shparlinski I.

1 2014

1 2011

Wyniki wyszukiwania

On Fully Split Lacunary Polynomials in Finite Fields

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs