Circuit decompositions of join‐covered graphs

In this paper, we focus our attention on join‐covered graphs, that is, ±1‐weighted graphs, without negative circuits, in which every edge lies in a zero‐weight circuit. Join covered graphs are a natural generalization of matching‐covered graphs. Many important properties of matching covered graphs, such as the existence of a canonical partition, tight cut decomposition and ear decomposition, have been generalized to join covered graphs by A. Seb? [5]. In this paper we prove that any two edges of a join‐covered graph lie on a zero‐weight circuit (under an equivalent weighting), generalize this statement to an arbitrary number of edges, and characterize minimal bipartite join‐covered graphs. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 220–233, 2009     

A variational characterization of rate‐independent evolution

Rate‐independent evolution driven by non‐convex potentials is by nature non‐smooth and some weak solvability notions have been recently advanced. This note is intended to contribute to this discussion by proposing a variational characterization of rate‐independent evolution based on a variational principle and a maximal dissipation criterion. The resulting novel solution notion is assessed in an elementary yet critical scalar case (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on minimal matching covered graphs

A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs without isolated vertices contain a perfect matching.     

K‐linked graphs with girth condition

Recently, Mader [ 7 ] proved that every 2k‐connected graph with girth g(G) sufficiently large is k‐linked. We show here that g(G ≥ 11 will do unless k = 4,5. If k = 4,5, then g(G) ≥ 19 will do. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 48–50, 2004     

Independent sets of maximal size in tensor powers of vertex‐transitive graphs

Let G be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product G × G are the preimages of the independent sets of maximal cardinality in G under projections, then the same holds for all finite tensor powers of G, thus providing an affirmative answer to a question raised by Larose and Tardif (J Graph Theory 40(3) (2002), 162–171). © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 295‐301, 2009     

Local well‐posedness for a system of quadratic nonlinear Schrödinger equations in one or two dimensions

In this article, the local well‐posedness of Cauchy's problem is explored for a system of quadratic nonlinear Schrödinger equations in the space L^p( R ⁿ). In a special case of mass resonant 2 × 2 system, it is well known that this problem is well posed in H^s(s≥0) and ill posed in H^s(s < 0) in two‐space dimensions. By translation on a linear semigroup, we show that the general system becomes locally well posed in L^p( R ²) for 1 < p < 2, for which p can arbitrarily be close to the scaling limit p_c=1. In one‐dimensional case, we show that the problem is locally well posed in L¹( R ); moreover, it has a measure valued solution if the initial data are a Dirac function. Copyright © 2016 John Wiley & Sons, Ltd.     

High‐girth cubic graphs are homomorphic to the Clebsch graph

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5‐colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph admits a homomorphism to the Clebsch graph (Fig. 1 ). Hopkins and Staton [J Graph Theory 6(2) (1982), 115–121] and Bondy and Locke [J Graph Theory 10(4) (1986), 477–504] proved that every (sub)cubic graph of girth at least 4 has an edge‐cut containing at least of the edges. The existence of such an edge‐cut follows immediately from the existence of a 5‐edge‐coloring as described above; so our theorem may be viewed as a coloring extension of their result (under a stronger girth assumption). Every graph which has a homomorphism to a cycle of length five has an above‐described 5‐edge‐coloring; hence our theorem may also be viewed as a weak version of Ne?et?il's Pentagon Problem (which asks whether every cubic graph of sufficiently high girth is homomorphic to C₅). Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 66: 241—259, 2011     

Clique‐coloring some classes of odd‐hole‐free graphs

We consider the problem of clique‐coloring, that is coloring the vertices of a given graph such that no maximal clique of size at least 2 is monocolored. Whereas we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, the existence of a constant C such that any perfect graph is C‐clique‐colorable is an open problem. In this paper we solve this problem for some subclasses of odd‐hole‐free graphs: those that are diamond‐free and those that are bull‐free. We also prove the NP‐completeness of 2‐clique‐coloring K₄‐free perfect graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 233–249, 2006     

Multilinear estimates and well‐posedness for the vortex filament fourth‐order Schrödinger equations

This paper is concerned with the initial value problem for the fourth‐order nonlinear Schrödinger type equation related to the theory of vortex filament. By deriving a fundamental estimate on dyadic blocks for the fourth‐order Schrödinger through the [k,Z]‐multiplier norm method. we establish multilinear estimates for this nonlinear fourth‐order Schrödinger type equation. The local well‐posedness for initial data in with s > 1 ∕ 2 is implied by the multilinear estimates. Copyright © 2012 John Wiley & Sons, Ltd.     

On large‐girth regular graphs and random processes on trees

We study various classes of random processes defined on the regular tree T_d that are invariant under the automorphism group of T_d. The most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov chains and a new class that we call typical processes. Using Glauber dynamics on processes we give a sufficient condition for a branching Markov chain to be factor of i.i.d.     

A characterization of weakly four‐connected graphs

A graph G = (V, E) is called weakly four‐connected if G is 4‐edge‐connected and G ? x is 2‐edge‐connected for all x ∈ V. We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four‐connected graphs. By using these results we prove that every minimally weakly four‐connected graph on at least four vertices contains at least three ‘splittable’ vertices of degree four, which gives rise to an inductive construction of weakly four‐connected graphs. Our results can also be applied in the problem of finding 2‐connected orientations of graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 217–229, 2006     

Convex‐round graphs are circular‐perfect

We show a connection between two concepts that have hitherto been investigated separately, namely convex‐round graphs and circular cliques. The connections are twofold. We prove that the circular cliques are precisely the cores of convex‐round graphs; this implies that convex‐round graphs are circular‐perfect, a concept introduced recently by Zhu [10]. Secondly, we characterize maximal K_r‐free convex‐round graphs and show that they can be obtained from certain circular cliques in a simple fashion. Our proofs rely on several structural properties of convex‐round graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 182–194, 2002     

The circular chromatic number of series‐parallel graphs with large girth

It was proved by Hell and Zhu that, if G is a series‐parallel graph of girth at least 2⌊(3k − 1)/2⌋, then χ_c(G) ≤ 4k/(2k − 1). In this article, we prove that the girth requirement is sharp, i.e., for any k ≥ 2, there is a series‐parallel graph G of girth 2⌊(3k − 1)/2⌋ − 1 such that χ_c(G) > 4k/(2k − 1). © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 185–198, 2000     

On well‐posedness for some thermo‐piezoelectric coupling models

There is an increasing reliance on mathematical modelling to assist in the design of piezoelectric ultrasonic transducers since this provides a cost‐effective and quick way to arrive at a first prototype. Given a desired operating envelope for the sensor, the inverse problem of obtaining the associated design parameters within the model can be considered. It is therefore of practical interest to examine the well‐posedness of such models. There is a need to extend the use of such sensors into high‐temperature environments, and so this paper shows, for a broad class of models, the well‐posedness of the magneto‐electro‐thermo‐elastic problem. Because of its widespread use in the literature, we also show the well‐posedness of the quasi‐electrostatic case. Copyright © 2016 John Wiley & Sons, Ltd.     

Classification of non‐well‐founded sets and an application

A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti‐well‐founded (awf) sets, i. e., non‐well‐founded sets whose all maximal ∈‐paths are circular, are studied. For example they form transitive inner models of ZFC minus foundation and empty set, and they include uncountably many hereditarily finite awf sets. A complete list of Finsler and Boffa awf sets with 2 and 3 elements in their transitive closure is given. Next the existence of infinite descending ∈‐sequences in Aczel universes is shown. Finally a theorem of Ballard and Hrbá?ek concerning nonstandard Boffa universes of sets is considerably extended.     

On the well‐posedness of a mathematical model of quorum‐sensing in patchy biofilm communities

We analyze a system of reaction–diffusion equations that models quorum‐sensing in a growing biofilm. The model comprises two nonlinear diffusion effects: a porous medium‐type degeneracy and super diffusion. We prove the well‐posedness of the model. In particular, we present for the first time a uniqueness result for this type of problem. Moreover, we illustrate the behavior of model solutions in numerical simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

Sufficient conditions for λ′‐optimality in graphs with girth g

For a connected graph the restricted edge‐connectivity λ′(G) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts S such that there are no isolated vertices in G–S. A graph G is said to be λ′‐optimal if λ′(G) = ξ(G), where ξ(G) is the minimum edge‐degree in G defined as ξ(G) = min{d(u) + d(v) ? 2:uv ∈ E(G)}, d(u) denoting the degree of a vertex u. A. Hellwig and L. Volkmann [Sufficient conditions for λ′‐optimality in graphs of diameter 2, Discrete Math 283 (2004), 113–120] gave a sufficient condition for λ′‐optimality in graphs of diameter 2. In this paper, we generalize this condition in graphs of diameter g ? 1, g being the girth of the graph, and show that a graph G with diameter at most g ? 2 is λ′‐optimal. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 73–86, 2006     

Maximal K3's and Hamiltonicity of 4‐connected claw‐free graphs

Let cl(G) denote Ryjá?ek's closure of a claw‐free graph G. In this article, we prove the following result. Let G be a 4‐connected claw‐free graph. Assume that G[N_G(T)] is cyclically 3‐connected if T is a maximal K₃ in G which is also maximal in cl(G). Then G is hamiltonian. This result is a common generalization of Kaiser et al.'s theorem [J Graph Theory 48(4) (2005), 267–276] and Pfender's theorem [J Graph Theory 49(4) (2005), 262–272]. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Local well‐posedness and blow‐up criterion for a compressible Navier‐Stokes‐Fourier‐P1 approximate model arising in radiation hydrodynamics

We establish a local well‐posedness and a blow‐up criterion of strong solutions for the compressible Navier‐Stokes‐Fourier‐P1 approximate model arising in radiation hydrodynamics. For the local well‐posedness result, we do not need the assumption on the positivity of the initial density and it may vanish in an open subset of the domain.     

Global well‐posedness for the 2D dissipative quasi‐geostrophic equations in modulation spaces

We prove the existence of global weak solution of the two‐dimensional dissipative quasi‐geostrophic equations with small initial data in and local well‐posedness with the large initial data in the same space. Our proof is based on constructing a commutator related to the problem, as well as its estimate. Copyright © 2017 John Wiley & Sons, Ltd.