Gromov hyperbolic cubic graphs

If X is a geodesic metric space and x ₁; x ₂; x ₃ ∈ X, a geodesic triangle T = {x ₁; x ₂; x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. We denote by δ(X) the sharp hyperbolicity constant of X, i.e., δ(X) = inf {δ ≥ 0: X is δ-hyperbolic}. We obtain information about the hyperbolicity constant of cubic graphs (graphs with all of their vertices of degree 3), and prove that for any graph G with bounded degree there exists a cubic graph G* such that G is hyperbolic if and only if G* is hyperbolic. Moreover, we prove that for any cubic graph G with n vertices, we have δ(G) ≤ min {3n/16 + 1; n/4}. We characterize the cubic graphs G with δ(G) ≤ 1. Besides, we prove some inequalities involving the hyperbolicity constant and other parameters for cubic graphs.     

Bounds on Gromov hyperbolicity constant in graphs

If X is a geodesic metric space and x ₁,x ₂,x ₃ ∈ X, a geodesic triangle T = {x ₁,x ₂,x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, i.e. $\delta(X)=\inf\{\delta\ge 0: \, X \, \text{ is $\delta(X)=\inf\{\delta\ge 0: \, X \, \text{ is In this paper we relate the hyperbolicity constant of a graph with some known parameters of the graph, as its independence number, its maximum and minimum degree and its domination number. Furthermore, we compute explicitly the hyperbolicity constant of some class of product graphs.     

Hyperbolicity in median graphs

If X is a geodesic metric space and x ₁,x ₂,x ₃?∈?X, a geodesic triangle T?=?{x ₁,x ₂,x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. If X is hyperbolic, we denote by δ(X) the sharp hyperbolicity constant of X, i.e., ${\delta}(X)=\inf\{{\delta}\ge 0: \, X \, \text{is $\delta$-hyperbolic}\}. $ In this paper we study the hyperbolicity of median graphs and we also obtain some results about general hyperbolic graphs. In particular, we prove that a median graph is hyperbolic if and only if its bigons are thin.     

On the hyperbolicity constant in graphs

If X is a geodesic metric space and x₁,x₂,x₃∈X, a geodesic triangleT={x₁,x₂,x₃} is the union of the three geodesics [x₁x₂], [x₂x₃] and [x₃x₁] in X. The space X is δ-hyperbolic (in the Gromov sense) if, for every geodesic triangle T in X, every side of T is contained in a δ-neighborhood of the union of the other two sides. We denote by δ(X) the sharpest hyperbolicity constant of X, i.e. . In this paper, we obtain several tight bounds for the hyperbolicity constant of a graph and precise values of this constant for some important families of graphs. In particular, we investigate the relationship between the hyperbolicity constant of a graph and its number of edges, diameter and cycles. As a consequence of our results, we show that if G is any graph with m edges with lengths , then , and if and only if G is isomorphic to C_m. Moreover, we prove the inequality for every graph, and we use this inequality in order to compute the precise value δ(G) for some common graphs.     

On total chromatic number of planar graphs without 4-cycles

Let G be a simple graph with maximum degree A(G) and total chromatic number Xve(G). Vizing conjectured thatΔ(G) 1≤Xve(G)≤Δ(G) 2 (Total Chromatic Conjecture). Even for planar graphs, this conjecture has not been settled yet. The unsettled difficult case for planar graphs isΔ(G) = 6. This paper shows that if G is a simple planar graph with maximum degree 6 and without 4-cycles, then Xve(G)≤8. Together with the previous results on this topic, this shows that every simple planar graph without 4-cycles satisfies the Total Chromatic Conjecture.     

Expanders obtained from affine transformations

A bipartite graphG=(U, V, E) is an (n, k, δ, α) expander if |U|=|V|=n, |E|≦kn, and for anyX⊆U with |X|≦αn, |Γ _G (X)|≧(1+δ(1−|X|/n)) |X|, whereΓ _G (X) is the set of nodes inV connected to nodes inX with edges inE. We show, using relatively elementary analysis in linear algebra, that the problem of estimating the coefficientδ of a bipartite graph is reduced to that of estimating the second largest eigenvalue of a matrix related to the graph. In particular, we consider the case where the bipartite graphs are defined from affine transformations, and obtain some general results on estimating the eigenvalues of the matrix by using the discrete Fourier transform. These results are then used to estimate the expanding coefficients of bipartite graphs obtained from two-dimensional affine transformations and those obtained from one-dimensional ones.     

Isometry Groups of Proper Hyperbolic Spaces

Let X be a proper hyperbolic geodesic metric space and let G be a closed subgroup of the isometry group Iso(X) of X. We show that if G is not elementary then for every p ∈ (1, ∞) the second continuous bounded cohomology group H²_cb(G, L^p(G)) does not vanish. As an application, we derive some structure results for closed subgroups of Iso(X). Partially supported by Sonderforschungsbereich 611.     

Characterizing hyperbolic spaces and real trees

Let X be a geodesic metric space. Gromov proved that there exists ε ₀ > 0 such that if every sufficiently large triangle Δ satisfies the Rips condition with constant ε ₀ · pr(Δ), where pr(Δ) is the perimeter of Δ, then X is hyperbolic. We give an elementary proof of this fact, also giving an estimate for ε ₀. We also show that if all the triangles D í X{\Delta \subseteq X} satisfy the Rips condition with constant ε ₀ · pr(Δ), then X is a real tree. Moreover, we point out how this characterization of hyperbolicity can be used to improve a result by Bonk, and to provide an easy proof of the (well-known) fact that X is hyperbolic if and only if every asymptotic cone of X is a real tree.     

Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs

 Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ _U (x)=inf{k⩾1:T ^k xεU}, and defineG _U (t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U _n ) _n≥1 of neighbourhoods ofx such that {x}=∩ _n U _n , and for anyG ∈G, there exists a subsequence (n _k ) _k≥1 withG _{U n k} ↑U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ^∞,S, μ), the orbit closure of a Toeplitz sequencex ^∞, such that the above conclusion still holds, with moreover the requirement that eachU _n be a cylinder set. In memory of Anzelm Iwanik     

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

For any vertex u∈V(G), let T_N(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C_f(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that C_f(x)≠C_f(y), we refer to f as a k-avsdt-coloring of G("avsdt"is the abbreviation of"adjacent-vertex-strongly- distinguishing total"). The avsdt-coloring number of G, denoted by X_(ast)(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G) 1≤X_(ast)(G)≤Δ(G) 2 for any tree or unique cycle graph G.     

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

 Let p(G) and c(G) denote the number of vertices in a longest path and a longest cycle, respectively, of a finite, simple graph G. Define σ₄(G)=min{d(x ₁)+d(x ₂)+ d(x ₃)+d(x ₄) | {x ₁,…,x ₄} is independent in G}. In this paper, the difference p(G)−c(G) is considered for 2-connected graphs G with σ₄(G)≥|V(G)|+3. Among others, we show that p(G)−c(G)≤2 or every longest path in G is a dominating path. Received: August 28, 2000 Final version received: May 23, 2002     

On Optimal Orientations of Cartesian Products of Trees

. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T _i }, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏ _{i =1} ⁿ T _i admits an (r, d)-invariant orientation provided that d(T ₁)≥d(T ₂)≥4 for n=2, and d(T ₁)≥5 and d(T ₂)≥4 for n≥3. Received: July 30, 1997 Final version received: April 20, 1998     

Almost continuous orbit equivalence for non-singular homeomorphisms

Let X and Y be Polish spaces with non-atomic Borel measures μ and ν of full support. Suppose that T and S are ergodic non-singular homeomorphisms of (X, μ) and (Y, ν) with continuous Radon-Nikodym derivatives. Suppose that either they are both of type III ₁ or that they are both of type III _λ, 0 < λ < 1 and, in the III _λ case, suppose in addition that both ‘topological asymptotic ranges’ (defined in the article) are log λ · ℤ. Then there exist invariant dense G _δ-subsets X′ ⊂ X and Y′ ⊂ Y of full measure and a non-singular homeomorphism ϕ: X′ → Y′ which is an orbit equivalence between T| _X′ and S| _Y′, that is ϕ{T ⁱ x} = {S ⁱ ϕx} for all x ∈ X′. Moreover, the Radon-Nikodym derivative dν ∘ ϕ/dμ is continuous on X′ and, letting S′ = ϕ ⁻¹ Sϕ, we have T _x = S′ ^n(x) x and S′x = T ^m(x) x where n and m are continuous on X′.     

Subcontinuity

We give interesting characterizations using subcontinuity. Let X, Y be topological spaces. We study subcontinuity of multifunctions from X to Y and its relations to local compactness, local total boundedness and upper semicontinuity. If Y is regular, then F is subcontinuous iff [`(F)]\bar F is USCO. A uniform space Y is complete iff for every topological space X and for every net {F _a }, F _a ⊂ X × Y, of multifunctions subcontinuous at x ∈ X, uniformly convergent to F, F is subcontinuous at x. A Tychonoff space Y is Čech-complete (resp. G _m-space) iff for every topological space X and every multifunction F ⊂ X × Y the set of points of subcontinuity of F is a G _δ -subset (resp. G _m-subset) of X.     

Hamiltonian Cycles in Almost Claw-Free Graphs

 Some known results on claw-free graphs are generalized to the larger class of almost claw-free graphs. In this paper, we prove the following two results and conjecture that every 5-connected almost claw-free graph is hamiltonian. (1). Every 2-connected almost claw-free graph G∉J on n≤ 4 δ vertices is hamiltonian, where J is the set of all graphs defined as follows: any graph G in J can be decomposed into three disjoint connected subgraphs G ₁, G ₂ and G ₃ such that E _G (G _i , G _j ) = {u _i , u _j , v _i v _j } for i≠j and i,j = 1, 2, 3 (where u _i ≠v _i ∈V(G _i ) for i = 1, 2, 3). Moreover the bound 4δ is best possible, thereby fully generalizing several previous results. (2). Every 3-connected almost claw-free graph on at most 5δ−5 vertices is hamiltonian, hereby fully generalizing the corresponding result on claw-free graphs. Received: September 21, 1998 Final version received: August 18, 1999     

Topological ergodic decompositions and applications to products of powers of a minimal transformation

For a minimal distal flow (X, T) and a positive integern, let be the largest distal factor of ordern. The existence of a denseG _δ subset ω ofX is shown, such that forx ∈ ω the orbit closure of (x,x,...,x) ∈ X ⁿ⁺¹ under τ =T ×T ² ... ×T ⁿ⁺¹ is π-saturated. In fact, an analogous statement for a general minimal flow is proved in terms of its PI-tower. On the way we get some topological “ergodic” decomposition theorems.     

An Exceptional Set in the Ergodic Theory of Expanding Maps on Manifolds

Under a general hypothesis an expanding map T of a Riemannian manifold M is known to preserve a measure equivalent to the Liouville measure on that manifold. As a consequence of this and Birkhoff’s pointwise ergodic theorem, the orbits of almost all points on the manifold are asymptotically distributed with regard to this Liouville measure. Let T be Lipschitz of class τ for some τ in (0,1], let Ω(x) denote the forward orbit closure of x and for a positive real number δ and let E(x₀, δ) denote the set of points x in M such that the distance from x₀ to Ω is at least δ. Let dim A denote the Hausdorff dimension of the set A. In this paper we prove a result which implies that there is a constant C(T) > 0 such that dimE(x₀,d) 3 dimM - \fracC(T)|logd| \dim E(x_0,\delta) \ge \dim M - \frac{C(T)}{\vert\!\log \delta \vert} if τ = 1 and dimE(x₀,d) 3 dimM - \fracC(T)log|logd|\dim E(x_0,\delta) \ge \dim M - \frac{C(T)}{\log \vert \log \delta \vert} if τ < 1. This gives a quantitative converse to the above asymptotic distribution phenomenon. The result we prove is of sufficient generality that a similar result for expanding hyperbolic rational maps of degree not less than two follows as a special case.     

Some results on distance two labelling of outerplanar graphs

Let G be an outerplanar graph with maximum degree △. Let χ（G^2） and A（G） denote the chromatic number of the square and the L（2, 1）-labelling number of G, respectively. In this paper we prove the following results： （1） χ（G^2） = 7 if △= 6; （2） λ（G） ≤ △ ＋5 if △ ≥ 4, and ）,（G）≤ 7 if △ = 3; and （3） there is an outerplanar graph G with △ = 4 such that ）λ（G） = 7. These improve some known results on the distance two labelling of outerplanar graphs.