نتایج جستجو برای: vasilev conjecture

تعداد نتایج: 37064  

Journal: :Discrete Mathematics 2003
S. K. Gupta Pankaj Mangal Vineet Paliwal

In this paper we de2ne 2ve families of simple graphs {fi,f2,f^,t^ and F=5) such that the reconstruction conjecture is true if reconstruction is proved for either the families $[,$2 & % or the families F=3;F=4 and F=5. These families are quite restrictive in that each has diameter two or three. Then we prove that families F=1;F=2;F=3;F=4 and F=5 are recognizable by proving that graphs of diamete...

2006
Roman G. Smirnov Pavel Winternitz

We show that the three body Calogero model with inverse square potentials can be interpreted as a maximally superintegrable and multiseparable system in Euclidean three-space. As such it is a special case of a family of systems involving one arbitrary function of one

Journal: :J. Comb. Theory, Ser. B 2011
Ken-ichi Kawarabayashi Kenta Ozeki

Motivated by the well-known conjecture by Lovász [6] on the connectivity after the path removal, we study the following problem: There exists a function f = f(k, l) such that the following holds. For every f(k, l)connected graph G and two distinct vertices s and t in G, there are k internally disjoint paths P1, . . . , Pk with endpoints s and t such that G− ⋃k i=1 V (Pi) is l-connected. When k ...

Journal: :Electr. J. Comb. 2014
Erkko Lehtonen

We formulate a reconstruction problem for functions of several arguments: Is a function of several arguments uniquely determined, up to equivalence, by its identification minors? We establish some positive and negative results on this reconstruction problem. In particular, we show that totally symmetric functions (of sufficiently large arity) are reconstructible.

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

For a finite group $G$‎, ‎let $Cent(G)$ denote the set of centralizers of single elements of $G$‎. ‎In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent‎, ‎then $Gcong S_3‎, ‎D_{10}$ or $S_3times S_3$‎. ‎This result gives a partial and positive answer to a conjecture raised by A‎. ‎R‎. ‎Ashrafi [On finite groups with a given number of centralizers‎, ‎Algebra‎ ‎Collo...

Journal: :Nagoya Mathematical Journal 2003

Journal: :Journal of the Mathematical Society of Japan 2005

Journal: :bulletin of the iranian mathematical society 0
b. khosravi department of pure mathematics‎, ‎faculty of mathematics and computer sciences‎, ‎amirkabir university of technology‎, ‎424‎, ‎hafez ave.‎, ‎tehran 15914‎, ‎iran. a. babai department of mathematics‎, ‎university of qom‎, ‎p.o‎. ‎box 37185-3766‎, ‎qom‎, ‎iran‎.

vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime gr...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید