On size, order, diameter and minimum degree

Let G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in terms of order, diameter and minimum degree. Our result is a strengthening of an old classical theorem of Ore [Diameters in graphs, J. Combin. Theory, 5 (1968), 75–81] if minimum degree is prescribed and constant.     

On diversity and stability of unit bases for the Euclidean metric

We prove the existence of a family Ω(n) of 2 ^c (where c is the cardinality of the continuum) subgraphs of the unit distance graph (E ⁿ , 1) of the Euclidean space E ⁿ , n ≥ 2, such that (a) for each graph G ? Ω(n), any homomorphism of G to (E ⁿ , 1) is an isometry of E ⁿ ; moreover, for each subgraph G ₀ of the graph G obtained from G by deleting less than c vertices, less than c stars, and less than c edges (we call such a subgraph reduced), any homomorphism of G ₀ to (E ⁿ , 1) is an isometry (of the set of the vertices of G ₀); (b) each graph G ? Ω(n) cannot be homomorphically mapped to any other graph of the family Ω(n), and the same is true for each reduced subgraph of G.     

On Spanning Disjoint Paths in Line Graphs

Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and Interconnection Networks, 2009). For a graph G and an integer s > 0 and for ${u, v \in V(G)}$ with u ≠ v, an (s; u, v)-path-system of G is a subgraph H consisting of s internally disjoint (u,v)-paths. A graph G is spanning s-connected if for any ${u, v \in V(G)}$ with u ≠ v, G has a spanning (s; u, v)-path-system. The spanning connectivity κ*(G) of a graph G is the largest integer s such that G has a spanning (k; u, v)-path-system, for any integer k with 1 ≤ k ≤ s, and for any ${u, v \in V(G)}$ with u ≠ v. An edge counter-part of κ*(G), defined as the supereulerian width of a graph G, has been investigated in Chen et al. (Supereulerian graphs with width s and s-collapsible graphs, 2012). In Catlin and Lai (Graph Theory, Combinatorics, and Applications, vol. 1, pp. 207–222, 1991) proved that if a graph G has 2 edge-disjoint spanning trees, and if L(G) is the line graph of G, then κ*(L(G)) ≥ 2 if and only if κ(L(G)) ≥ 3. In this paper, we extend this result and prove that for any integer k ≥ 2, if G ₀, the core of G, has k edge-disjoint spanning trees, then κ*(L(G)) ≥ k if and only if κ(L(G)) ≥ max{3, k}.     

Degree of equivariant maps between generalized G-manifolds

Yasuhiro Hara in [Topology Appl. 148 (2005), 113–121] and Jan Jaworowski in [J. Fixed Point Theory Appl. 1 (2007), 111–121] studied, under certain conditions, the degree of equivariant maps between free G-manifolds, where G is a compact Lie group. The main results obtained by them involve data provided by the classifying maps of the orbit spaces. In this paper, we extend these results by replacing the free G-manifolds by free generalized G-manifolds over ${\mathbb{Z}}$ .     

Existence of extremal metrics on almost homogeneous manifolds of cohomogeneity one —IV

This paper is the first of a series of papers in which we generalize our results in (Asian J. of Math. 4, 817–830 (2000); J. Geom. Anal. 12, 63–79 (2002); Intern. J. Math. 14, 259–287 (2003)) to the general complex compact almost homogeneous manifolds of real cohomogeneity one. In this paper we deal with the exceptional case of the G ₂ action (Cf. Intern. J. Math. 14, 259–287 (2003), p. 285). In particular, we prove the existence of Kähler-Einstein metric on this manifold.     

Shintani lifting and real-valued characters

We study Shintani lifting of real-valued irreducible characters of finite reductive groups. In particular, if G is a connected reductive group defined over ${\mathbb{F}_q}$ , and ψ is an irreducible character of G( ${\mathbb{F}_{q^m}}$ ) which is the lift of an irreducible character χ of G( ${\mathbb{F}_q}$ ), we prove ψ is real-valued if and only if χ is real-valued. In the case m = 2, we show that if χ is invariant under the twisting operator of G( ${\mathbb{F}_{q^2}}$ ), and is a real-valued irreducible character in the image of lifting from G( ${\mathbb{F}_q}$ ), then χ must be an orthogonal character. We also study properties of the Frobenius–Schur indicator under Shintani lifting of regular, semisimple, and irreducible Deligne–Lusztig characters of finite reductive groups.     

Snarks,Hypohamiltonian Graphs and Non-Supereulerian Graphs

A graph G is hypohamiltonian if it is not Hamiltonian but for each \(v\in V(G)\), the graph \(G-v\) is Hamiltonian. A graph is supereulerian if it has a spanning Eulerian subgraph. A graph G is called collapsible if for every even subset \(R\subseteq V(G)\), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is reduced if it has no nontrivial collapsible subgraphs. In this note, we first prove that all hypohamiltonian cubic graphs are reduced non-supereulerian graphs. Then we introduce an operation to construct graphs from hypohamiltonian cubic graphs such that the resulting graphs are 3-edge-connected non-supereulerian reduced graphs and cannot be contracted to a snark. This disproves two conjectures, one of which was first posed by Catlin et al. in [Congr. Num. 76:173–181, 1990] and in [J. Combin. Theory, Ser B 66:123–139, 1996], and was posed again by Li et al. in [Acta Math. Sin. English Ser 30(2):291–304, 2014] and by Yang in [Supereulerian graphs, hamiltonicity of graphs and several extremal problems in graphs, Ph. D. Dissertation, Université Paris-Sub, September 27, 2013], respectively, the other one was posed by Yang 2013.     

Regular principal factors in free objects in varieties in the interval [B 2 ,NB 2 ∨G n ]

The author has shown previously how to associate a completely 0-simple semigroup with a connected bipartite graph containing labelled edges and how to describe the regular principal factors in the free objects in the Rees-Sushkevich varieties RS _n generated by all completely 0-simple semigroups over groups from the Burnside variety G _n of groups of exponent dividing a positive integer n by employing this graphical construction. Here we consider the analogous problem for varieties containing the variety B ₂ , generated by the five element Brandt semigroup B ₂, and contained in the variety NB ₂ ∨G _n where NB ₂ is the variety generated by all left and right zero semigroups together with B ₂. The interval [NB ₂ ,NB ₂ ∨G _n ] is of particular interest as it is an important interval, consisting entirely of varieties generated by completely 0-simple semigroups, in the lattice of subvarieties of RS _n .     

On the Ramsey Number of Sparse 3-Graphs

We consider a hypergraph generalization of a conjecture of Burr and Erd?s concerning the Ramsey number of graphs with bounded degree. It was shown by Chvátal, Rödl, Trotter, and Szemerédi [The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), no. 3, 239–243] that the Ramsey number R(G) of a graph G of bounded maximum degree is linear in |V(G)|. We derive the analogous result for 3-uniform hypergraphs.     

Invariant random graphs with iid degrees in a general geography

Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive finite-degree graph. Continuing the work of Deijfen and Meester (Adv Appl Probab 38:287–298) and Deijfen and Jonasson (Electron Comm Probab 11:336–346), we seek an Aut(G)-invariant random graph model with V as vertex set, iid degrees distributed as D and finite mean connections (i.e., the sum of the edge lengths in the graph metric of G of a given vertex has finite expectation). It is shown that if G has either polynomial growth or rapid growth, then such a random graph model exists if and only if ${\mathbb{E}[D\,R(D)] < \infty}$ . Here R(n) is the smallest possible radius of a combinatorial ball containing more than n vertices. With rapid growth we mean that the number of vertices in a ball of radius n is of at least order exp(n ^c ) for some c > 0. All known transitive graphs have either polynomial or rapid growth. It is believed that no other growth rates are possible. When G has rapid growth, the result holds also when the degrees form an arbitrary invariant process. A counter-example shows that this is not the case when G grows polynomially. For this case, we provide other, quite sharp, conditions under which the stronger statement does and does not hold respectively. Our work simplifies and generalizes the results for ${G\,=\,\mathbb {Z}}$ in [4] and proves, e.g., that with ${G\,=\,\mathbb {Z}^d}$ , there exists an invariant model with finite mean connections if and only if ${\mathbb {E}[D^{(d+1)/d}] < \infty}$ . When G has exponential growth, e.g., when G is a regular tree, the condition becomes ${\mathbb {E}[D\,\log\,D] < \infty}$ .     

Strong convergence theorems for strictly asymptotically pseudocontractive mappings in Hilbert spaces

The purpose of this paper is by using CSQ method to study the strong convergence problem of iterative sequences for a pair of strictly asymptotically pseudocontractive mappings to approximate a common fixed point in a Hilbert space. Under suitable conditions some strong convergence theorems are proved. The results presented in the paper are new which extend and improve some recent results of Acedo and Xu [Iterative methods for strict pseudo-contractions in Hilbert spaces. Nonlinear Anal., 67(7), 2258??271 (2007)], Kim and Xu [Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups. Nonlinear Anal., 64, 1140??152 (2006)], Martinez-Yanes and Xu [Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal., 64, 2400??411 (2006)], Nakajo and Takahashi [Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl., 279, 372??79 (2003)], Marino and Xu [Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. J. Math. Anal. Appl., 329(1), 336??46 (2007)], Osilike et al. [Demiclosedness principle and convergence theorems for k-strictly asymptotically pseudocontractive maps. J. Math. Anal. Appl., 326, 1334??345 (2007)], Liu [Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nonlinear Anal., 26(11), 1835??842 (1996)], Osilike et al. [Fixed points of demi-contractive mappings in arbitrary Banach spaces. Panamer Math. J., 12 (2), 77??8 (2002)], Gu [The new composite implicit iteration process with errors for common fixed points of a finite family of strictly pseudocontractive mappings. J. Math. Anal. Appl., 329, 766??76 (2007)].     

On a class of sofic affine invariant subsets of the 2-torus related to an Erd?s problem

Let 1 < β <?2 be a real number and G be the closed projection on the 2-torus of the (modified) Rademacher graph in base β. The smallest compact containing G and left invariant by the diagonal endomorphism ${(x,y)\mapsto(2x,\beta y)}$ (mod 1) is denoted by K. For β a simple Parry number of PV-type, K is proved to be a sofic affine invariant set with a fractal geometry closed to the one of G. When β is the golden number, we prove the uniqueness of the measure with full Hausdorff dimension on K.     

Generation and Enumeration of Some Classes of Interval Orders

In this paper we consider the class of interval orders, recently considered by several authors from both an algebraic and an enumerative point of view. According to Fishburn’s Theorem (Fishburn J Math Psychol 7:144–149, 1970), these objects can be characterized as posets avoiding the poset 2?+?2. We provide a recursive method for the unique generation of interval orders of size n?+?1 from those of size n, extending the technique presented by El-Zahar (1989) and then re-obtain the enumeration of this class, as done in Bousquet-Melou et al. (2010). As a consequence we provide a method for the enumeration of several subclasses of interval orders, namely AV(2?+?2, N), AV(2?+?2, 3?+?1), AV(2?+?2, N, 3?+?1). In particular, we prove that the first two classes are enumerated by the sequence of Catalan numbers, and we establish a bijection between the two classes, based on the cardinalities of the principal ideals of the posets.     

Toughness and Matching Extension in {\mathcal{P}_3}-Dominated Graphs

Let G be a connected graph. For ${x,y\in V(G)}$ with d(x, y) = 2, we define ${J(x,y)= \{u \in N(x)\cap N(y)\mid N[u] \subseteq N[x] \,{\cup}\,N[y] \}}$ and ${J'(x,y)= \{u \in N(x) \cap N(y)\,{\mid}\,{\rm if}\ v \in N(u){\setminus}(N[x] \,{\cup}\, N[y])\ {\rm then}\ N[x] \,{\cup}\, N[y]\,{\cup}\,N[u]{\setminus}\{x,y\}\subseteq N[v]\}}$ . A graph G is quasi-claw-free if ${J(x,y) \not= \emptyset}$ for each pair (x, y) of vertices at distance 2 in G. Broersma and Vumar (in Math Meth Oper Res. doi:10.1007/s00186-008-0260-7) introduced ${\mathcal{P}_{3}}$ -dominated graphs defined as ${J(x,y)\,{\cup}\, J'(x,y)\not= \emptyset}$ for each ${x,y \in V(G)}$ with d(x, y) = 2. This class properly contains that of quasi-claw-free graphs, and hence that of claw-free graphs. In this note, we prove that a 2-connected ${\mathcal{P}_3}$ -dominated graph is 1-tough, with two exceptions: K _2,3 and K _1,1,3, and prove that every even connected ${\mathcal{P}_3}$ -dominated graph ${G\ncong K_{1,3}}$ has a perfect matching. Moreover, we show that every even (2p + 1)-connected ${\mathcal{P}_3}$ -dominated graph is p-extendable. This result follows from a stronger result concerning factor-criticality of ${\mathcal{P}_3}$ -dominated graphs.     

On rings whose number of centralizers of ideals is finite

LetR be a ring. For the setF of all nonzero ideals ofR, we introduce an equivalence relation inF as follows: For idealsI andJ, I～J if and only ifV _R (I)=V _R(J), whereV _R() is the centralizer inR. LetI _R=F/～. Then we can see thatn(I _R), the cardinality ofI _R, is 1 if and only ifR is either a prime ring or a commutative ring (Theorem 1.1). An idealI ofR is said to be a commutator ideal ifI is generated by{st?ts; s∈S, t∈T} for subsetS andT ofR, andR is said to be a ring with (N) if any commutator ideal contains no nonzero nilpotent ideals. Then we have the following main theorem: LetR be a ring with (N). Thenn(I _R) is finite if and only ifR is isomorphic to an irredundant subdirect sum ofS⊕Z whereS is a finite direct sum of non commutative prime rings andZ is a commutative ring (Theorem 2.1). Finally, we show that the existence of a ringR such thatn(I _R)=m for any given natural numberm.     

A Motzkin–Straus Type Result for 3-Uniform Hypergraphs

Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in [8]. They showed that if G is a 2-graph in which a largest clique has order l then ${\lambda(G)=\lambda(K^{(2)}_l),}$ where λ(G) denotes the Lagrangian of G. It is interesting to study a generalization of the Motzkin–Straus Theorem to hypergraphs. In this note, we give a Motzkin–Straus type result. We show that if m and l are positive integers satisfying ${{l-1 \choose 3} \le m \le {l-1 \choose 3} + {l-2 \choose 2}}$ and G is a 3-uniform graph with m edges and G contains a ${K_{l-1}^{(3)}}$ , a clique of order l?1, then ${\lambda(G) = \lambda(K_{l-1}^{(3)})}$ . Furthermore, the upper bound ${{l-1 \choose 3} + {l-2 \choose 2}}$ is the best possible.     

On Rational Pairings of Functors

In the theory of coalgebras C over a ring R, the rational functor relates the category $_{C^*}{\mathbb{M}}$ of modules over the algebra C ^* (with convolution product) with the category $^C{\mathbb{M}}$ of comodules over C. This is based on the pairing of the algebra C ^* with the coalgebra C provided by the evaluation map ${\rm ev}:C^*\otimes_R C\to R$ . The (rationality) condition under consideration ensures that $^C{\mathbb{M}}$ becomes a coreflective full subcategory of $_{C^*}{\mathbb{M}}$ . We generalise this situation by defining a pairing between endofunctors T and G on any category ${\mathbb{A}}$ as a map, natural in $a,b\in {\mathbb{A}}$ , $$ \beta_{a,b}:{\mathbb{A}}(a, G(b)) \to {\mathbb{A}}(T(a),b), $$ and we call it rational if these all are injective. In case T?=?(T, m _T , e _T ) is a monad and G?=?(G, δ _G , ε _G ) is a comonad on ${\mathbb{A}}$ , additional compatibility conditions are imposed on a pairing between T and G. If such a pairing is given and is rational, and T has a right adjoint monad T ^???, we construct a rational functor as the functor-part of an idempotent comonad on the T-modules ${\mathbb{A}}_{T}$ which generalises the crucial properties of the rational functor for coalgebras. As a special case we consider pairings on monoidal categories.