Covering Planar Graphs with a Fixed Number of Balls

In this note we prove that there exists a constant ρ such that any planar graph G of diameter ≤ 2R can be covered with at most ρ balls of radius R, a result conjectured by Gavoille, Peleg, Raspaud, and Sopena in 2001.     

Full Graphs and Koszul Algebras I

The main result of this article is the establishment of a new connection between combinatorics and noncommutative algebra. This is done by linking a certain class of directed graphs, called full graphs, to quotients of path algebras that are Koszul algebras.     

Full Graphs and Koszul Algebras II

This paper continues the study of n-full graphs and their connection to certain Koszul algebras started in Green and Hartman (to appear). We provide constructive methods for creating new full graphs from old and study the associated Koszul algebras and the projective resolution of simple modules over such algebras.     

On the Structure of Graphs with Low Obstacle Number

The obstacle number of a graph G is the smallest number of polygonal obstacles in the plane with the property that the vertices of G can be represented by distinct points such that two of them see each other if and only if the corresponding vertices are joined by an edge. We list three small graphs that require more than one obstacle. Using extremal graph theoretic tools developed by Pr?mel, Steger, Bollobás, Thomason, and others, we deduce that for any fixed integer h, the total number of graphs on n vertices with obstacle number at most h is at most 2^o(n2){2^{o(n^2)}}. This implies that there are bipartite graphs with arbitrarily large obstacle number, which answers a question of Alpert et al. (Discret Comput Geom doi:, 2009).     

The Structure of Trivalent Graphs with Minimal Eigenvalue Gap

Let G be a connected trivalent graph on nvertices (n10) such that among all connected trivalentgraphs on n vertices, G has the largest possiblesecond eigenvalue. We show that G must be reduced path-like, i.e. G must be of the form: where theends are one of the following:(the right-hand end block is the mirror image of one of the blocks shown)and the middle blocks are one of the following: This partially solves a conjecture implicit in a paper of Bussemaker,obelji, Cvetkovi, and Seidel [3].     

On the Structure of Graphs with Bounded Asteroidal Number

 A set A⊆V of the vertices of a graph G=(V,E) is an asteroidal set if for each vertex a∈A, the set A\{a} is contained in one component of G−N[a]. The maximum cardinality of an asteroidal set of G, denoted by an (G), is said to be the asteroidal number of G. We investigate structural properties of graphs of bounded asteroidal number. For every k≥1, an (G)≤k if and only if an (H)≤k for every minimal triangulation H of G. A dominating target is a set D of vertices such that D∪S is a dominating set of G for every set S such that G[D∪S] is connected. We show that every graph G has a dominating target with at most an (G) vertices. Finally, a connected graph G has a spanning tree T such that d _T (x,y)−d _G (x,y)≤3·|D|−1 for every pair x,y of vertices and every dominating target D of G. Received: July 3, 1998 Final version received: August 10, 1999     

Enumeration of Full Graphs: Onset of the Asymptotic Region

A full graph on n vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of n sets. It has an undirected edge between vertices representing intersecting sets and a directed edge from a to b if the corresponding set A contains B;. Kleitman, Lasaga, and Cowen gave a unified argument to show that asymptotically, almost all full graphs can be obtained by taking an arbitrary undirected graph on the n vertices, distinguishing a clique in this graph, which need not be maximal, and then adding directed edges going out from each vertex in the clique to all vertices to which there is not already an existing undirected edge. Call graphs of this type members of the dominant class. This article obtains the first upper and lower bounds on how large n has to be, so that the asymptotic behavior is indeed observed. It is shown that when n > 170, the dominant class predominates, while when n < 17, the full graphs in the dominant class compose less than half of the total number of realizable full graphs on n vertices.     

Finding Minors in Graphs with a Given Path Structure

Given graphs G and H with , suppose that we have a ‐path in G for each edge in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we seek conditions that ensure that G contains H as a rooted minor or minor. This naturally leads to studying sets of paths that form an H‐immersion, with the additional property that paths that contain the same vertex must have a common endpoint. We say that H is contractible if, whenever G contains such an H‐immersion, G must also contain a rooted H‐minor. We show, for example, that forests, cycles, K₄, and K_{1, 1, 3} are contractible, but that graphs that are not 6‐colorable and graphs that contain certain subdivisions of K_{2, 3} are not contractible.     

匹配可扩图的结构

设G是一个有限的简单连通图。D（G）表示V（G）的一个子集,它的每一个点至少有一个最大匹配不覆盖它。A（G）表示V（G）-D（G）的一个子集,它的每一个点至少和D（G）的一个点相邻。最后设C（G）=V（G）-A（G）-D（G）。在这篇章中,下面的被获得。⑴设u∈V（G）。若n≥1和G是n-可扩的,则（a)C(G-u)=φ和A（G-u)∪{u}是一个独立集,（b)G的每个完美匹配包含D（G-u)的每个分支的一个几乎守美匹配,并且它匹配A（G-u)∪{u}的所有点与D（G-4）的不同分支的点。⑵若G是2-可扩的,则对于u∈V（G）,A（G-u）∪{u}是G的一个最大障碍且G的最大障碍的个数是2或是│V(G)│.⑶设X=Cay(Q,S),则对于u∈Q,(a)A(X-u)=φ=C（G-u)和X-u是一个因子临界图,或（b)C(X-u)=φ和X的两部是A（X-u)∪{u}和D（X-u)且│A(X-u)∪{u}│=│D(X-u）│。⑷设X=Cay(Q,S),则对于u∈Q,A（X-u)∪{u}是X的一个最大障碍且X的最大障碍的个数是2或是│Q│。     

全正规弧传递和1/2-弧传递Cayley图

给出了全正规弧传递和1/2-弧传递Cayley图的构造,并构造了一些群类上分类结果.     

Perfect Domination Polynomial of Homogeneous Caterpillar Graphs and of Full Binary Trees

Mathematical Notes - Let $$G=(V,E)$$ be a simple graph of order $$n$$ . A set $$S \subseteq V(G)$$ is a perfect dominating set of a graph $$G$$ if every vertex $$v\in V(G)-S$$ is adjacent to...     

On the Structure of Graphs with Given Odd Girth and Large Minimum Degree

We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andrásfai, Erd?s, and Sós implies that every n‐vertex graph with odd girth and minimum degree bigger than must be bipartite. We consider graphs with a weaker condition on the minimum degree. Generalizing results of Häggkvist and of Häggkvist and Jin for the cases and 3, we show that every n‐vertex graph with odd girth and minimum degree bigger than is homomorphic to the cycle of length . This is best possible in the sense that there are graphs with minimum degree and odd girth that are not homomorphic to the cycle of length . Similar results were obtained by Brandt and Ribe‐Baumann.     

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision

In the graph sharing game, two players share a connected graph G with nonnegative weights assigned to the vertices claiming and collecting the vertices of G one by one, while keeping the set of all claimed vertices connected through the whole game. Each player wants to maximize the total weight of the vertices they have gathered by the end of the game, when the whole G has been claimed. It is proved that for any class of graphs with an odd number of vertices and with forbidden subdivision of a fixed graph (e.g., for the class of planar graphs with an odd number of vertices), there is a constant such that the first player can secure at least the proportion of the total weight of G whenever . Known examples show that such a constant does no longer exist if any of the two conditions on the class (an odd number of vertices or a forbidden subdivision) is removed. The main ingredient in the proof is a new structural result on weighted graphs with a forbidden subdivision.     

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

For a family \(\mathcal {F}\) of graphs, a graph U is induced-universal for \({\mathcal{F}}\) if every graph in \({\mathcal{F}}\) is an induced subgraph of U. We give a construction for an induced-universal graph for the family of graphs on n vertices with degree at most r, which has \(Cn^{\lfloor (r+1)/2\rfloor}\) vertices and \(Dn^{2\lfloor (r+1)/2\rfloor -1}\) edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such an induced-universal graph must have at least cn ^r/2 vertices for some c depending only on r.Our construction is explicit in that no probabilistic tools are needed to show that the graph exists or that a given graph is induced-universal. The construction also extends to multigraphs and directed graphs with bounded degree.     

一类混合图的结构及其特征空间

主要讨论具有如下性质的一类连通混合图G:其所有非奇异圈恰有一条公共边,且除了该公共边的端点外,任意两个非奇异圈没有其它交点.本文给出了图G的结构性质,建立了其最小特征值λ1(G)(以及相对应的特征向量)与某个简单图的代数连通度(以及Fiedler向量)之间联系,并应用上述联系证明了λ1(■)≤α(G),其中G是由G通过对其所有无向边定向而获得,α(■)为■的代数连通度.     

Almost Isometries of Balls

Let f be a bi-Lipschitz mapping of the Euclidean ball B ^_n into ℓ₂ with both Lipschitz constants close to one. We investigate the shape of f(B ^_n). We give examples of such a mapping f, which has the Lipschitz constants arbitrarily close to one and at the same time has in the supremum norm the distance at least one from every isometry of ⁿ.     

The Structure of Hereditary Properties and Colourings of Random Graphs

in the probability space ? Second, does there exist a constant such that the -chromatic number of the random graph is almost surely ? The second question was posed by Scheinerman (SIAM J. Discrete Math. 5 (1992) 74–80). The two questions are closely related and, in the case p=1/2, have already been answered. Pr?mel and Steger (Contemporary Mathematics 147, Amer. Math. Soc., Providence, 1993, pp. 167-178), Alekseev (Discrete Math. Appl. 3 (1993) 191-199) and the authors ( Algorithms and Combinatorics 14 Springer-Verlag (1997) 70–78) provided an approximation which was used by the authors (Random Structures and Algorithms 6 (1995) 353–356) to answer the -chromatic question for p=1/2. However, the approximating properties that work well for p=1/2 fail completely for . In this paper we describe a class of properties that do approximate in , in the following sense: for any desired accuracy of approximation, there is a property in our class that approximates to this level of accuracy. As may be expected, our class includes the simple properties used in the case p=1/2. The main difficulty in answering the second of our two questions, that concerning the -chromatic number of , is that the number of small -graphs in has, in general, large variance. The variance is smaller if we replace by a simple approximation, but it is still not small enough. We overcome this by considering instead a very rigid non-hereditary subproperty of the approximating property; the variance of the number of small -graphs is small enough for our purpose, and the structure of is sufficiently restricted to enable us to show this by a fine analysis. Received April 20, 1999