Displaying similar documents to “On graphs G for which both g and G̅ are claw-free”

Multiplicative free square of the free Poisson measure and examples of free symmetrization

Melanie Hinz, Wojciech Młotkowski (2010)

Colloquium Mathematicae

Similarity:

We compute the moments and free cumulants of the measure ρ t : = π t π t , where π t denotes the free Poisson law with parameter t > 0. We also compute free cumulants of the symmetrization of ρ t . Finally, we introduce the free symmetrization of a probability measure on ℝ and provide some examples.

Colouring graphs with prescribed induced cycle lengths

Bert Randerath, Ingo Schiermeyer (2001)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we study the chromatic number of graphs with two prescribed induced cycle lengths. It is due to Sumner that triangle-free and P₅-free or triangle-free, P₆-free and C₆-free graphs are 3-colourable. A canonical extension of these graph classes is I ( 4 , 5 ) , the class of all graphs whose induced cycle lengths are 4 or 5. Our main result states that all graphs of I ( 4 , 5 ) are 3-colourable. Moreover, we present polynomial time algorithms to 3-colour all triangle-free graphs G of this kind,...

On traceability and 2-factors in claw-free graphs

Dalibor Fronček, Zdeněk Ryjáček, Zdzisław Skupień (2004)

Discussiones Mathematicae Graph Theory

Similarity:

If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² - 4k + 7 (where k is an arbitrary constant), then G has a 2-factor with at most k - 1 components. As a second main result, we present classes of graphs ₁,...,₈ such that every sufficiently large connected claw-free graph satisfying degree condition σ₆(k) > n + 19 (or, as a corollary, δ(G) > (n+19)/6) either belongs to i = 1 i or is traceable.

Stable sets for ( P , K 2 , 3 ) -free graphs

Raffaele Mosca (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes for which MS can be efficiently solved have been detected and the augmenting graph technique seems to be a fruitful tool to this aim. In this paper we apply a recent characterization of minimal augmenting graphs [22] to prove that MS can be solved for ( P , K 2 , 3 ) -free graphs in polynomial time, extending some known results.

2-factors in claw-free graphs

Guantao Chen, Jill R. Faudree, Ronald J. Gould, Akira Saito (2000)

Discussiones Mathematicae Graph Theory

Similarity:

We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connected claw-free graph with sufficiently high minimum degree. (By claw-free we mean the graph has no induced K 1 , 3 .) In particular, we show that for such a graph G of order n ≥ 51 with δ(G) ≥ (n-2)/3, G contains a 2-factor with exactly k cycles, for 1 ≤ k ≤ (n-24)/3. We also show that this result is sharp in the sense that if we lower δ(G), we cannot obtain the full range of values for k. ...

k -free separable groups with prescribed endomorphism ring

Daniel Herden, Héctor Gabriel Salazar Pedroza (2015)

Fundamenta Mathematicae

Similarity:

We will consider unital rings A with free additive group, and want to construct (in ZFC) for each natural number k a family of k -free A-modules G which are separable as abelian groups with special decompositions. Recall that an A-module G is k -free if every subset of size < k is contained in a free submodule (we will refine this in Definition 3.2); and it is separable as an abelian group if any finite subset of G is contained in a free direct summand of G. Despite the fact that such a...

A free stochastic partial differential equation

Yoann Dabrowski (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We get stationary solutions of a free stochastic partial differential equation. As an application, we prove equality of non-microstate and microstate free entropy dimensions under a Lipschitz like condition on conjugate variables, assuming also the von Neumann algebra R ω embeddable. This includes an N -tuple of q -Gaussian random variables e.g. for | q | N 0 . 13 .

Remarks on partially square graphs, hamiltonicity and circumference

Hamamache Kheddouci (2001)

Discussiones Mathematicae Graph Theory

Similarity:

Given a graph G, its partially square graph G* is a graph obtained by adding an edge (u,v) for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition N G ( x ) N G [ u ] N G [ v ] , where N G [ x ] = N G ( x ) x . In the case where G is a claw-free graph, G* is equal to G². We define σ ° = m i n x S d G ( x ) : S i s a n i n d e p e n d e n t s e t i n G * a n d | S | = t . We give for hamiltonicity and circumference new sufficient conditions depending on σ° and we improve some known results.

Pairs of square-free values of the type n 2 + 1 , n 2 + 2

Stoyan Dimitrov (2021)

Czechoslovak Mathematical Journal

Similarity:

We show that there exist infinitely many consecutive square-free numbers of the form n 2 + 1 , n 2 + 2 . We also establish an asymptotic formula for the number of such square-free pairs when n does not exceed given sufficiently large positive number.

Computation of some examples of Brown's spectral measure in free probability

Philippe Biane, Franz Lehner (2001)

Colloquium Mathematicae

Similarity:

We use free probability techniques to compute spectra and Brown measures of some non-hermitian operators in finite von Neumann algebras. Examples include u + u where uₙ and u are the generators of ℤₙ and ℤ respectively, in the free product ℤₙ*ℤ, or elliptic elements of the form S α + i S β where S α and S β are free semicircular elements of variance α and β.

Large free subgroups of automorphism groups of ultrahomogeneous spaces

Szymon Głąb, Filip Strobin (2015)

Colloquium Mathematicae

Similarity:

We consider the following notion of largeness for subgroups of S . A group G is large if it contains a free subgroup on generators. We give a necessary condition for a countable structure A to have a large group Aut(A) of automorphisms. It turns out that any countable free subgroup of S can be extended to a large free subgroup of S , and, under Martin’s Axiom, any free subgroup of S of cardinality less than can also be extended to a large free subgroup of S . Finally, if Gₙ are countable...

Regularity of Lipschitz free boundaries for the thin one-phase problem

Daniela De Silva, Ovidiu Savin (2015)

Journal of the European Mathematical Society

Similarity:

We study regularity properties of the free boundary for the thin one-phase problem which consists of minimizing the energy functional E ( u , Ω ) = Ω | u | 2 d X + n ( { u > 0 } { x n + 1 = 0 } ) , Ω n + 1 , among all functions u 0 which are fixed on Ω .

Formally self-referential propositions for cut free classical analysis and related systems

G. Kreisel, G. Takeuti

Similarity:

CONTENTSIntroduction............................................................................................................................................................................................................ 5  I. Results on self-referential propositions............................................................................................................................. 11    1. Definitions of some principal metamathematical notions......................................................................

A note on certain partial sum operators

Marek Bożejko, Gero Fendler (2006)

Banach Center Publications

Similarity:

We show that for the t-deformed semicircle measure, where 1/2 < t ≤ 1, the expansions of L p functions with respect to the associated orthonormal polynomials converge in norm when 3/2 < p < 3 and do not converge when 1 ≤ p < 3/2 or 3 < p. From this we conclude that natural expansions in the non-commutative L p spaces of free group factors and of free commutation relations do not converge for 1 ≤ p < 3/2 or 3 < p.

On some free semigroups, generated by matrices

Piotr Słanina (2015)

Czechoslovak Mathematical Journal

Similarity:

Let A = 1 2 0 1 , B λ = 1 0 λ 1 . We call a complex number λ “semigroup free“ if the semigroup generated by A and B λ is free and “free” if the group generated by A and B λ is free. First families of semigroup free λ ’s were described by J. L. Brenner, A. Charnow (1978). In this paper we enlarge the set of known semigroup free λ ’s. To do it, we use a new version of “Ping-Pong Lemma” for semigroups embeddable in groups. At the end we present most of the known results related to semigroup free and free numbers in a common...

The Herz-Schur multiplier norm of sets satisfying the Leinert condition

Éric Ricard, Ana-Maria Stan (2011)

Colloquium Mathematicae

Similarity:

It is well known that in a free group , one has | | χ E | | M c b A ( ) 2 , where E is the set of all the generators. We show that the (completely) bounded multiplier norm of any set satisfying the Leinert condition depends only on its cardinality. Consequently, based on a result of Wysoczański, we obtain a formula for | | χ E | | M c b A ( ) .

On the Lukacs property for free random variables

Kamil Szpojankowski (2015)

Studia Mathematica

Similarity:

The Lukacs property of the free Poisson distribution is studied. We prove that if free and are free Poisson distributed with suitable parameters, then + and ( + ) - 1 / 2 ( + ) - 1 / 2 are free. As an auxiliary result we compute the joint cumulants of and - 1 for free Poisson distributed . We also study the Lukacs property of the free Gamma distribution.

Maps into the torus and minimal coincidence sets for homotopies

D. L. Goncalves, M. R. Kelly (2002)

Fundamenta Mathematicae

Similarity:

Let X,Y be manifolds of the same dimension. Given continuous mappings f i , g i : X Y , i = 0,1, we consider the 1-parameter coincidence problem of finding homotopies f t , g t , 0 ≤ t ≤ 1, such that the number of coincidence points for the pair f t , g t is independent of t. When Y is the torus and f₀,g₀ are coincidence free we produce coincidence free pairs f₁,g₁ such that no homotopy joining them is coincidence free at each level. When X is also the torus we characterize the solution of the problem in terms of the...

4-cycle properties for characterizing rectagraphs and hypercubes

Khadra Bouanane, Abdelhafid Berrachedi (2017)

Czechoslovak Mathematical Journal

Similarity:

A ( 0 , 2 ) -graph is a connected graph, where each pair of vertices has either 0 or 2 common neighbours. These graphs constitute a subclass of ( 0 , λ ) -graphs introduced by Mulder in 1979. A rectagraph, well known in diagram geometry, is a triangle-free ( 0 , 2 ) -graph. ( 0 , 2 ) -graphs include hypercubes, folded cube graphs and some particular graphs such as icosahedral graph, Shrikhande graph, Klein graph, Gewirtz graph, etc. In this paper, we give some local properties of 4-cycles in ( 0 , λ ) -graphs and more specifically...