Cycles through specified vertices

Recently, various authors have obtained results about the existence of long cycles in graphs with a given minimum degreed. We extend these results to the case where only some of the vertices are known to have degree at leastd, and we want to find a cycle through as many of these vertices as possible. IfG is a graph onn vertices andW is a set ofw vertices of degree at leastd, we prove that there is a cycle through at least vertices ofW. We also find the extremal graphs for this property.Research supported in part by NSF Grant DMS 8806097     

Packing two graphs of ordern having total size at most 2n − 2

Two graphsG andH of the same order are packable ifG can be embedded in the complement ofH. In this paper we give a complete characterization of two graphs of ordern having total size at most 2n – 2 which are packable. This result extends an earlier result of B. Bollobás and S.E. Eldridge.     

Some properties of graph centroids

The concept of a branch weight centroid has been extended in [12] so that it can be defined for an arbitrary finite setX with a distinguished familyC of "convex" subsets ofX. In particular, the centroid of a graphG was defined forX to be the vertex setV(G) ofG andU V(G) is convex if it is the vertex set of a chordless path inG. In this paper, which is an extended version of [13], we give necessary and sufficient conditions for a graph to be a centroid of another graph as well as of itself. Then, we apply these results to some particular classes of graphs: chordal, Halin, series-parallel and outerplanar.This research has been partly supported by Grant RP.I.09 from the Institute of Computer Science, University of Warsaw. This paper was completed when the second author was at Fachbereich 3 -Mathematik, Technische Universität Berlin, supported also by the Alexander von Humboldt-Stiftung (Bonn).     

OnK 4-free subgraphs of random graphs

For 0<1 and graphsG andH, writeGH if any -proportion of the edges ofG spans at least one copy ofH inG. As customary, writeK ^r for the complete graph onr vertices. We show that for every fixed real >0 there exists a constantC=C() such that almost every random graphG _n,p withp=p(n)Cn ^–2/5 satisfiesG _{n,p 2/3+} K ⁴. The proof makes use of a variant of Szemerédi's regularity lemma for sparse graphs and is based on a certain superexponential estimate for the number of pseudo-random tripartite graphs whose triangles are not too well distributed. Related results and a general conjecture concerningH-free subgraphs of random graphs in the spirit of the Erds-Stone theorem are discussed.The first author was partially supported by FAPESP (Proc. 93/0603-1) and by CNPq (Proc. 300334/93-1 and ProTeM-CC-II Project ProComb). Part of this work was done while the second author was visiting the University of São Paulo, supported by FAPESP (Proc. 94/4276-8). The third author was partially supported by the NSF grant DMS-9401559.     

An Ω(n 4/3) lower bound on the randomized complexity of graph properties

We improve King's (n ^5/4) lower bound on the randomized decision tree complexity of monotone graph properties to (n ^4/3). The proof follows Yao's approach and improves it in a different direction from King's. At the heart of the proof are a duality argument combined with a new packing lemma for bipartite graphs.The paper was written while the author was a graduate student at the University of Chicago and was completed at M.I.T. The work was supported in part by NSF under GRANT number NSF 5-27561, the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discret Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648.     

Zwei Klassen lokalkompakter maximal fastperiodischer Gruppen

In this paper we study the class of all locally compact groupsG with the property that for each closed subgroupH ofG there exists a pair of homomorphisms into a compact group withH as coincidence set, and the class of all locally compact groupG with the property that finite dimensional unitary representations of subgroups ofG can be extended to finite dimensional representations ofG. It is shown that [MOORE]-groups (every irreducible unitary representation is finite dimensional) have these two properties. A solvable group in is a [MOORE]-group. Moreover, we prove a structure theorem for Lie groups in the class [MOORE], and show that compactly generated Lie groups in [MOORE] have faithful finite dimensional unitary representations.     

Universally signable graphs

In a graph, a chordless cycle of length greater than three is called a hole. Let be a {0, 1} vector whose entries are in one-to-one correspondence with the holes of a graphG. We characterize graphs for which, for all choices of the vector , we can pick a subsetF of the edge set ofG such that |F H| H (mod 2), for all holesH ofG and |F T| 1 for all trianglesT ofG. We call these graphsuniversally signable. The subsetF of edges is said to be labelledodd. All other edges are said to be labelledeven. Clearly graphs with no holes (triangulated graphs) are universally signable with a labelling of odd on all edges, for all choices of the vector . We give a decomposition theorem which leads to a good characterization of graphs that are universally signable. This is a generalization of a theorem due to Hajnal and Surányi [3] for triangulated graphs.This work was supported in part by NSF grants DMI-9424348 DMS-9509581 and ONR grant N00014-89-J-1063. Ajai Kapoor was also supported by a grant from Gruppo Nazionale Delle Ricerche-CNR. We also acknowledge the support of Laboratoire ARTEMIS, Université Joseph Fourier, Grenoble.     

Rotation numbers for complete tripartite graphs

Arooted graph is a pair (G, x), whereG is a simple undirected graph andx V(G). IfG is rooted atx, then itsrotation number h(G, x) is the minimum number of edges in a graphF of the same order asG such that for allv V(F), we can find a copy ofG inF with the rootx atv. Rotation numbers for all complete bipartite graphs are now known (see [2], [4], [7]). In this paper we calculate rotation numbers for complete tripartite graphs with rootx in the largest vertex class.Funded by the Science and Engineering Research Council.     

Crossing families

Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two setsA andB of points in the plane are mutually avoiding if no line subtended by a pair of points inA intersects the convex hull ofB, and vice versa. We show that any set ofn points in general position contains a pair of mutually avoiding subsets each of size at least . As a consequence we show that such a set possesses a crossing family of size at least , and describe a fast algorithm for finding such a family.Research supported in part by DARPA grant N00014-89-J-1988, Air Force AFOSR-89-0271, NSF grant DMS-8606225, and an ONR graduate fellowship. Further, part of this work was conducted at and supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC8809648.     

Bi-complement Reducible Graphs

We introduce a new family of bipartite graphs which is the bipartite analogue of the class ofcomplement reduciblegraphs orcographs. Abi-complement reduciblegraph orbi-cographis a bipartite graphG = (W ∪ B, E) that can be reduced to single vertices by recursively bi-complementing the edge set of all connected bipartite subgraphs. Thebi-complementedgraphofGis the graph having the same vertex setW ∪ BasG, while its edge set is equal toW × B − E. The aim of this paper is to show that there exists an equivalent definition of bi-cographs by three forbidden configurations. We also propose a tree representation for this class of graphs.     

Can visibility graphs Be represented compactly?

We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques. Given a graphG, a familyG={G ₁,G ₂,...,G _k } is called aclique cover ofG if (i) eachG _i is a clique or a bipartite clique, and (ii) the union ofG _i isG. The size of the clique coverG is defined as ∑ _i=1 ^k n _i , wheren _i is the number of vertices inG _i . Our main result is that there are visibility graphs ofn nonintersecting line segments in the plane whose smallest clique cover has size Ω(n ²/log² n). An upper bound ofO(n ²/logn) on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility graph of a simple polygon always admits a clique cover of sizeO(nlog³ n), and that there are simple polygons whose visibility graphs require a clique cover of size Ω(n logn). The work by the first author was supported by National Science Foundation Grant CCR-91-06514. The work by the second author was supported by a USA-Israeli BSF grant. The work by the third author was supported by National Science Foundation Grant CCR-92-11541.     

Maximal Energy Bipartite Graphs

 Given a graph G, its energy E(G) is defined to be the sum of the absolute values of the eigenvalues of G. This quantity is used in chemistry to approximate the total π-electron energy of molecules and in particular, in case G is bipartite, alternant hydrocarbons. Here we show that if G is a bipartite graph with n vertices, then

Greatest common divisors and least common multiples of graphs

A graphH divides a graphG, writtenH|G, ifG isH-decomposable. A graphG without isolated vertices is a greatest common divisor of two graphsG ₁ andG ₂ ifG is a graph of maximum size for whichG|G ₁ andG|G ₂, while a graphH without isolated vertices is a least common multiple ofG ₁ andG ₂ ifH is a graph of minimum size for whichG ₁|H andG ₂|H. It is shown that every two nonempty graphs have a greatest common divisor and least common multiple. It is also shown that the ratio of the product of the sizes of a greatest common divisor and least common multiple ofG ₁ andG ₂ to the product of their sizes can be arbitrarily large or arbitrarily small. Sizes of least common multiples of various pairsG ₁,G ₂ of graphs are determined, including when one ofG ₁ andG ₂ is a cycle of even length and the other is a star.G. C's research was supported in part by the Office of Naval Research, under Grant N00014-91-I-1060     

Pancyclicity of Strong Products of Graphs

We prove that the strong product of graphs G₁××G_n is pancyclic, in particular hamiltonian, for nc for any cln(25/12)+1/640.75 whenever all G_i are connected graphs with the maximum degree at most .This research was supported by KONTAKT ME 337 as a part of REU programme and in part by GACR 201/99/0242The author acknowledges partial support by NSF grant DMS-9900969 and by Institute for Theoretical Computer ScienceThe author acknowledges partial support by Institute for Theoretical Computer ScienceInstitute for Theoretical Computer Science is supported by Ministry of Education of Czech Republic as project LN00A056Final version received: August 6, 2003     

Hamiltonicity in balancedk-partite graphs

One of the earliest results about hamiltonian graphs was given by Dirac. He showed that if a graphG has orderp and minimum degree at least thenG is hamiltonian. Moon and Moser showed that a balanced bipartite graph (the two partite sets have the same order)G has orderp and minimum degree more than thenG is hamiltonian. In this paper, their idea is generalized tok-partite graphs and the following result is obtained: LetG be a balancedk-partite graph with orderp = kn. If the minimum degree

A left-first search algorithm for planar graphs

We give anO(|V(G)|)-time algorithm to assign vertical and horizontal segments to the vertices of any bipartite plane graphG so that (i) no two segments have an interior point in common, and (ii) two segments touch each other if and only if the corresponding vertices are adjacent. As a corollary, we obtain a strengthening of the following theorem of Ringel and Petrovič. The edges of any maximal bipartite plane graphG with outer facebwb′w′ can be colored by two colors such that the color classes form spanning trees ofG−b andG−b′, respectively. Furthermore, such a coloring can be found in linear time. Our method is based on a new linear-time algorithm for constructing bipolar orientations of 2-connected plane graphs. The research of H. de Fraysseix and P. O. de Mendez was supported by ESPRIT Basic Research Action No. 7141 (ALCOM II). J. Pach's research was supported by NSF Grant CCR-91-22103, OTKA-4269, and ALCOM II.     

Embedding theorem ofZ-graded Lie superalgebras

The embedding theorem ofZ-graded Lie superalgebras is given and proved. As a subsidiary result it is proved that a transitiveZ-graded restricted lie superalgebm must be isomorphic toW(m,n, 1) if the dimension ofG _i satisfies a certain condition. Project supported by the National Natural Science Foundation of China and the Science of the University Doctoral Program of CNEC.     

Hereditary modular graphs

In a hereditary modular graphG, for any three verticesu, v, w of an isometric subgraph ofG, there exists a vertex of this subgraph that is simultaneously on some shortestu, v-path,u, w-path andv, w-path. It is shown that the hereditary modular graphs are precisely those bipartite graphs which do not contain any isometric cycle of length greater than four. There is a polynomial-time algorithm available which decides whether a given (bipartite) graph is hereditary modular or not. Finally, the chordal bipartite graphs are characterized by forbidden isometric subgraphs.     

(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph

LetG be a simple graph. Letg(x) andf(x) be integer-valued functions defined onV(G) withf(x)g(x)1 for allxV(G). It is proved that ifG is an (mg+m–1,mf–m+1)-graph andH is a [1,2]-subgraph withm edges, then there exists a (g,f)-factorization ofG orthogonal toH.This work is supported by China Postdoctoral Science Foundation and Shandong Youth Science Foundation.     

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements

In this paper we show that, if G is a Berge graph such that neither G nor its complement contains certain induced subgraphs, named proper wheels and long prisms, then either G is a basic perfect graph( a bipartite graph, a line graph of a bipartite graph or the complement of such graphs) or it has a skew partition that cannot occur in a minimally imperfect graph. This structural result implies that G is perfect. This work was supported in part by NSF grant DMI-0352885 and ONR grant N00014-03-1-0188.