The Clar formulas of a benzenoid system and the resonance graph

It is shown that the number of Clar formulas of a Kekuléan benzenoid system B is equal to the number of subgraphs of the resonance graph of B isomorphic to the Cl(B)-dimensional hypercube, where Cl(B) is the Clar number of B.     

Unimodularity of the Clar number problem

We study the generalization to bipartite and 2-connected plane graphs of the Clar number, an optimization model proposed by Clar [E. Clar, The Aromatic Sextet, John Wiley & Sons, London, 1972] to compute indices of benzenoid hydrocarbons. Hansen and Zheng [P. Hansen, M. Zheng, The Clar number of a benzenoid hydrocarbon and linear programming, J. Math. Chem. 15 (1994) 93–107] formulated the Clar problem as an integer program and conjectured that solving the linear programming relaxation always yields integral solutions. We establish their conjecture by proving that the constraint matrix of the Clar integer program is always unimodular. Interestingly, in general these matrices are not totally unimodular. Similar results hold for the Fries number, an alternative index for benzenoids proposed earlier by Fries [K. Fries, Uber Byclische Verbindungen und ihren Vergleich mit dem Naphtalin, Ann. Chem. 454 (1927) 121–324].     

Extremal fullerene graphs with the maximum Clar number

A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let F_n be a fullerene graph with n vertices. A set of mutually disjoint hexagons of F_n is a sextet pattern if F_n has a perfect matching which alternates on and off every hexagon in . The maximum cardinality of sextet patterns of F_n is the Clar number of F_n. It was shown that the Clar number is no more than . Many fullerenes with experimental evidence attain the upper bound, for instance, C₆₀ and C₇₀. In this paper, we characterize extremal fullerene graphs whose Clar numbers equal . By the characterization, we show that there are precisely 18 fullerene graphs with 60 vertices, including C₆₀, achieving the maximum Clar number 8 and we construct all these extremal fullerene graphs.     

Invariant subspaces of analytic multiparticle Hamiltonians

The quantum mechanics of n particles interacting through analytic two-body interactions can be formulated as a problem of functional analysis on a Hilbert space $\text{G}$ consisting of analytic functions. On $\text{G}$, there is an Hamiltonian H with resolvent R(λ). These quantities are associated with families of operators H(?) and R(λ, ?) on $\text{L}$, the case ? = 0 corresponding to standard quantum mechanics. The spectrum of H(?) consists of possible isolated points, plus a number of half-lines starting at the thresholds of scattering channels and making an angle 2? with the real axis.Assuming that the two-body interactions are in the Schmidt class on the two-particle space $\text{G}$, this paper studies the resolvent R(λ, ?) in the case ? ≠ 0. It is shown that a well known Fredholm equation for R(λ, ?) can be solved by the Neumann series whenever ¦λ¦ is sufficiently large and λ is not on a singular half-line. Owing to this, R(λ, ?) can be integrated around the various half-lines to yield bounded idempotent operators P_p(?) (p = 1, 2,…) on $\text{L}$. The range of P_p(?) is an invariant subspace of H(?). As ? varies, the family of operators P_p(?) generates a bounded idempotent operator P_p on a space $\text{G}$. The range of this is an invariant subspace of H. The relevance of this result to the problem of asymptotic completeness is indicated.     

Brauer groups and Amitsur cohomology for general commutative ring extensions

Exact couples are interconnected families of long exact sequences extending the short exact sequences usually derived from spectral sequences. This is exploited to give a long exact sequence connecting Amitsur cohomology groups $\text{H>}{}^{\mathrm{n}}\text{(}\text{S}\text{R}\text{, U)}$ (where U means the multiplicative group) and $\text{H}{}^{\mathrm{n}}\text{(}\text{S}\text{R}\text{, Pic)}$ and a third sequence of groups Hⁿ(J), for every faithfully flat commutative R-algebra S. This same sequence is derived in another way without assuming faithful flatness and Hⁿ(J) is identified explicitly as a certain subquotient of a group of isomorphism classes of pairs (P, α) with P a rank one, projective Sⁿ-module and α an isomorphism from the coboundary of P (inPicS^{n + 1}) toS^{n + 1}. (Here Sⁿ denotes repeated tensor product of S over R.) This last formulation allows us to construct a homomorphism of the relative Brauer group $\text{B(}\text{S}\text{R}\text{)}$ to H²(J) which is a monomorphism when S is faithfully flat over R, and an isomorphism when some S-module is faithfully projective over R. The first approach also identifies H²(J) with Ker[H²(R, U)→H²(S, U)], where H²(R, U) denotes the ordinary, Grothendieck cohomology (in the étale topology, for example).     

The regular graph of a commutative ring

Let R be a commutative ring, let Z(R) be the set of all zero-divisors of R and Reg(R) = R\Z(R). The regular graph of R, denoted by G(R), is a graph with all elements of Reg(R) as the vertices, and two distinct vertices x, y ∈ Reg(R) are adjacent if and only if x+y ∈ Z(R). In this paper we show that if R is a commutative Noetherian ring and 2 ∈ Z(R), then the chromatic number and the clique number of G(R) are the same and they are 2 ⁿ , where n is the minimum number of prime ideals whose union is Z(R). Also, we prove that all trees that can occur as the regular graph of a ring have at most two vertices.     

Complex dynamical variables for multiparticle systems with analytic interactions. I

The n-body problem is formulated as a problem of functional analysis on a Hilbert space $\text{G}$ whose elements are analytic functions of complex dynamical variables. It is assumed that the two-body interaction is local and spherically symmetric, and belongs to the two-particle space $\text{G}$. The n-body resolvent R(λ) is constructed with the help of Fredholm methods. The operator R(λ) on $\text{G}$ is associated with a family of operators R(λ, ?) on $\text{L}$² which are resolvents of closed linear operators H(?), the case ? = 0 corresponding to standard quantum mechanics. The spectrum of H(?) contains a set of parallel half-lines starting at the thresholds of scattering channels and making an angle 2? with the positive real axis. The half-lines are branch cuts of R(λ, ?), but matrix elements of R(λ, ?) can be continued analytically across these. The operator R(λ, ?) may have isolated poles. The location of these does not depend on ?. Each pole is associated with one or more eigenvectors of H(?) belonging to spaces $\text{G}$. There may be poles off the real axis, the location of a pole determining for which values of ? it is on the physical sheet of H(?). It is shown how poles off the real axis give rise to resonances in the scattering cross section, the shape of a resonance being as one would expect on the basis of a model in which the scattering takes place via a decaying compound state having an eigenvector of H(?) with complex energy as its wave function.     

Thompson’s conjecture for Lie type groups E 7(q)

In this article, we prove a conjecture of Thompson for an infinite class of simple groups of Lie type E ₇(q). More precisely, we show that every finite group G with the properties Z(G) = 1 and cs(G) = cs(E ₇(q)) is necessarily isomorphic to E ₇(q), where cs(G) and Z(G) are the set of lengths of conjugacy classes of G and the center of G respectively.     

Relative colorings of graphs

In this paper, the notion of relative chromatic number χ(G, H) for a pair of graphs G, H, with H a full subgraph of G, is formulated; namely, χ(G, H) is the minimum number of new colors needed to extend any coloring of H to a coloring of G. It is shown that the four color conjecture (4CC) is equivalent to the conjecture (R4CC) that χ(G, H) ≤ 4 for any (possibly empty) full subgraph H of a planar graph G and also to the conjecture (CR3CC) that χ(G, H) ≤ 3 if H is a connected and nonempty full subgraph of planar G. Finally, relative coloring theorems on surfaces other than the plane or sphere are proved.     

Zero-divisor graphs, von Neumann regular rings, and Boolean algebras

For a commutative ring R with set of zero-divisors Z(R), the zero-divisor graph of R is Γ(R)=Z(R)−{0}, with distinct vertices x and y adjacent if and only if xy=0. In this paper, we show that Γ(T(R)) and Γ(R) are isomorphic as graphs, where T(R) is the total quotient ring of R, and that Γ(R) is uniquely complemented if and only if either T(R) is von Neumann regular or Γ(R) is a star graph. We also investigate which cardinal numbers can arise as orders of equivalence classes (related to annihilator conditions) in a von Neumann regular ring.     

On Ramsey numbers of uniform hypergraphs with given maximum degree

For every ?>0 and every positive integers Δ and r, there exists C=C(?,Δ,r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V(H)|^1+?.     

The Ramsey numbers for disjoint unions of graphs

For given graphs G and H, the Ramsey number R(G,H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H. In this paper we investigate the Ramsey number of a disjoint union of graphs . For any natural integer k, we contain a general upper bound, R(kG,H)?R(G,H)+(k-1)|V(G)|. We also show that if m=2n-4, 2n-8 or 2n-6, then R(kS_n,W_m)=R(S_n,W_m)+(k-1)n. Furthermore, if |G_i|>(|G_i|-|G_i+1|)(χ(H)-1) and R(G_i,H)=(χ(H)-1)(|G_i|-1)+1, for each i, then .     

Edge-colorings avoiding rainbow and monochromatic subgraphs

For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n;G,H), (minR(n;G,H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic to H. These two numbers generalize the classical anti-Ramsey and Ramsey numbers, respectively.We show that maxR(n;G,H), in most cases, can be expressed in terms of vertex arboricity of H and it does not depend on the graph G. In particular, we determine maxR(n;G,H) asymptotically for all graphs G and H, where G is not a star and H has vertex arboricity at least 3.In studying minR(n;G,H) we primarily concentrate on the case when G=H=K₃. We find minR(n;K₃,K₃) exactly, as well as all extremal colorings. Among others, by investigating minR(n;K_t,K₃), we show that if an edge-coloring of K_n in k colors has no monochromatic K_t and no rainbow triangle, then n?2^kt2.     

On spectral characterizations and embeddings of graphs

The least eigenvalue of the 0-1 adjacency matrix of a graph is denoted λ G. In this paper all graphs with λ(G) greater than ?2 are characterized. Such a graph is a generalized line graph of the form L(T;1,0,…,0), L(T), L(H), where T is a tree and H is unicyclic with an odd cycle, or is one of 573 graphs that arise from the root system E₈. If G is regular with λ(G)>?2, then Gis a clique or an odd circuit. These characterizations are used for embedding problems; λ_R(H) = sup{λ(G)z.sfnc;HinG; Gregular}. H is an odd circuit, a path, or a complete graph iff λ_R(H)> ?2. For any other line graph H, λ_R(H) = ?2. A similar result holds for complete multipartite graphs.     

Eigenvalues of a graph and its imbeddings

A graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph isomorphic to H. If λ(G) is the least eigenvalue of G and k_R(H) = lim sup_d→∞ {λ(G)| H imbedded in G; G regular and connected; diam(G) > d; deg(G) > d}, then λ(H) ? 2 ≤ k_R(H) ≤ λ(H) with these bounds being the best possible. Given a graph H, there exist arbitrarily large families of isospectral graphs such that H can be imbedded in each member of the family.     

A min-max theorem for plane bipartite graphs

We consider a partitioning problem, defined for bipartite and 2-connected plane graphs, where each node should be covered exactly once by either an edge or by a cycle surrounding a face. The objective is to maximize the number of face boundaries in the partition. This problem arises in mathematical chemistry in the computation of the Clar number of hexagonal systems. In this paper we establish that a certain minimum weight covering problem of faces by cuts is a strong dual of the partitioning problem. Our proof relies on network flow and linear programming duality arguments, and settles a conjecture formulated by Hansen and Zheng in the context of hexagonal systems [P. Hansen, M. Zheng, Upper Bounds for the Clar Number of Benzenoid Hydrocarbons, Journal of the Chemical Society, Faraday Transactions 88 (1992) 1621-1625].     

Star-critical Ramsey numbers

The graph Ramsey numberR(G,H) is the smallest integer r such that every 2-coloring of the edges of K_r contains either a red copy of G or a blue copy of H. We find the largest star that can be removed from K_r such that the underlying graph is still forced to have a red G or a blue H. Thus, we introduce the star-critical Ramsey numberr_∗(G,H) as the smallest integer k such that every 2-coloring of the edges of K_r−K_1,r−1−k contains either a red copy of G or a blue copy of H. We find the star-critical Ramsey number for trees versus complete graphs, multiple copies of K₂ and K₃, and paths versus a 4-cycle. In addition to finding the star-critical Ramsey numbers, the critical graphs are classified for R(T_n,K_m), R(nK₂,mK₂) and R(P_n,C₄).