The Number of Seymour Vertices in Random Tournaments and Digraphs

Seymour’s distance two conjecture states that in any digraph there exists a vertex (a “Seymour vertex”) that has at least as many neighbors at distance two as it does at distance one. We explore the validity of probabilistic statements along lines suggested by Seymour’s conjecture, proving that almost surely there are a “large” number of Seymour vertices in random tournaments and “even more” in general random digraphs.     

六阶图Q与星图S_n的积图交叉数

目前关于积图的交叉数的研究已经推广到六阶图与星图的积图.研究得到了一个特殊六阶图Q与n个孤立点nK_1的联图交叉数,然后通过收缩的方法,得到了Q与星图S_n的积图交叉数.     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices

In [5] Abbott and Katchalski ask if there exists a constantc < 0 such that for every d 2 there is a snake (cycle withoutchords) of length at least c3^d in the product of d copies ofthe complete graph K₃. We show that the answer to the abovequestion is positive, and that in general for any odd integern there is a constant c_n such that for every d 2 there is asnake of length at least c_n n^d in the product of d copies ofthe complete graph K_n.     

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph

Let k be a non-negative integer. A branch vertex of a tree is a vertex of degree at least three. We show two sufficient conditions for a connected claw-free graph to have a spanning tree with a bounded number of branch vertices: (i) A connected claw-free graph has a spanning tree with at most k branch vertices if its independence number is at most 2k + 2. (ii) A connected claw-free graph of order n has a spanning tree with at most one branch vertex if the degree sum of any five independent vertices is at least n ? 2. These conditions are best possible. A related conjecture also is proposed.     

On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices

A collection of nontrivial paths in a graph G is called a path pile of G, if every edge of G is on exactly one path and no two paths have a common internal vertex. The least number that can be the cardinality of a path pile of G is called the path piling number of G. It can be shown that ε ≤ ν + η where ε, ν and η are respectively the size, the order and the path piling number of G. In this note we characterize structurally the class of all graphs for which the equality of this relation holds.     

On the Expected Number of Shadow Vertices of the Convex Hull of Random Points

Leta₁, . . . ,a_mbe independent random points in ⁿthat are independent and identically distributed spherically symmetrical in ⁿ. Moreover, letXbe the random polytope generated as the convex hull ofa₁, . . . ,a_mand letL_kbe an arbitraryk-dimensional subspace of ⁿwith 2 ≤k≤n− 1. LetX_kbe the orthogonal projection image ofXinL_k. We call those vertices ofXwhose projection images inL_kare vertices ofX_kshadow vertices ofXwith respect to the subspaceL_k. We derive a distribution independent sharp upper bound for the expected number of shadow vertices ofXinL_k.     

h连通图中非临界点的个数

设Ｇ是ｈ连通的简单非完全图，ｖ中Ｇ的顶点，若ｋ（Ｇ－ｖ）≥ｋ（Ｇ），则称ｖ是Ｇ的非临界点，关于Ｇ中非临界点的个数，Ｖｅｌｄｍａｎ和苏健基分别给定了在不同条件下的下界，本文推广了他们的结果，得到了更一般的下界。     

The Number of Out-Pancyclic Vertices in a Strong Tournament

An arc in a tournament T with n ≥ 3 vertices is called pancyclic, if it belongs to a cycle of length l for all 3 ≤ l ≤ n. We call a vertex u of T an out-pancyclic vertex of T, if each out-arc of u is pancyclic in T. Yao et al. (Discrete Appl. Math. 99, 245–249, 2000) proved that every strong tournament contains an out-pancyclic vertex. For strong tournaments with minimum out-degree 1, Yao et al. found an infinite class of strong tournaments, each of which contains exactly one out-pancyclic vertex. In this paper, we prove that every strong tournament with minimum out-degree at least 2 contains three out-pancyclic vertices. Our result is best possible since there is an infinite family of strong tournaments with minimum degree at least 2 and no more than 3 out-pancyclic vertices.     

一个六阶3-连通图与路Pn的笛卡尔积的交叉数

C(6,2)表示由圈C6增加边vivi 2(i=1,…,6,i 2(m od6))所得的图,把边vivi 2叫做C(6,2)的弦,B表示C(6,2)除去一条弦所得到的图,我们确定了B与Pn笛卡尔积的交叉数为5n-1.     

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs

 A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete multipartite digraph. L. Volkmann conjectured that l≤2c−1, where l (c, respectively) is the number of vertices in a longest path (longest cycle) of a strong semicomplete multipartite digraph. The bound on l is sharp. We settle this conjecture in affirmative. Received: October 26, 1998?Final version received: August 16, 1999     

The Monoid of the Random Graph

We investigate properties of the endomorphism monoid of the countable random graph R. We show that End(R) is not regular and is not generated by its idempotents. The Rees order on the idempotents of End(R) has 2^N0 many minimal elements. We also prove that the order type of Q is embeddable in the Rees order of End(R).     

Measures on the Random Graph

We consider the problem of characterizing the finitely additiveprobability measures on the definable subsets of the randomgraph which are invariant under the action of the automorphismgroup of this graph. We show that such measures are all integralsof Bernoulli measures (which arise from the coin-flipping modelof the construction of the random graph). We also discuss generalizationsto other theories.     

On the Number of Subgraphs of a Specified Form Embedded in a Random Graph

Let U ₁, U ₂,... be a sequence of i.i.d. random elements in R^d. For x>0, a graph G _n (x) may be formed by connecting with an edge each pair of points in that are separated by a distance no greater than x. The points of G _n (x) could represent the stations in a telecommunications network and the edge set the lines of communication that exist among them. Let be a collection of graphs on mn points having a specified form or structure, and let denote the number of subgraphs embedded in G _n (x) and contained in . It is shown that a SLLN, CLT and LIL for follow easily from the theory of U-statistics. In addition, a uniform (in x) SLLN is proved for collections that satisfy a certain monotonicity condition. Some applications are mentioned and the results of some simulations presented. The scaling constants appearing in the CLT are usually hard to obtain. These are worked out for some special cases.     

The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges

Doklady Mathematics - We have proven that the maximum size k of an induced subgraph of the binomial random graph $$G(n,p)$$ with a given number of edges $$e(k)$$ (under certain conditions on this...     

Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs

Let k≥2 be an integer and G = (V(G), E(G)) be a k-edge-connected graph. For X⊆V(G), e(X) denotes the number of edges between X and V(G) − X. Let {s_i, t_i}⊆X_i⊆V(G) (i=1,2) and X₁∩X₂=∅. We here prove that if k is even and e(X_i)≤2k−1 (i=1,2), then there exist paths P₁ and P₂ such that P_i joins s_i and t_i, V(P_i)⊆X_i (i=1,2) and G − E(P₁∪P₂) is (k−2)-edge-connected (for odd k, if e(X₁)≤2k−2 and e(X₂)≤2k−1, then the same result holds [10]), and we give a generalization of this result and some other results about paths not containing given edges.     

On the Number of Vertices with Specified Eccentricity

The eccentricity of a vertex v in a graph is the maximum of the distances from v to all other vertices. The diameter of a graph is the maximum of the eccentricities of its vertices. Fix the parameters n, d, c. Over all graphs with order n and diameter d, we determine the maximum (within 1) and the minimum of the number of vertices with eccentricity c. Revised: May 7, 1999