Positional Games and the Second Moment Method

Dedicated to the memory of Paul Erdős We study the fair Maker–Breaker graph Ramsey game MB(n;q). The board is , the players alternately occupy one edge a move, and Maker wants a clique of his own. We show that Maker has a winning strategy in MB(n;q) if , which is exactly the clique number of the random graph on n vertices with edge-probability 1/2. Due to an old theorem of Erdős and Selfridge this is best possible apart from an additive constant. Received March 28, 2000     

A threshold for the Maker‐Breaker clique game

We study the Maker‐Breaker k‐clique game played on the edge set of the random graph G(n, p). In this game, two players, Maker and Breaker, alternately claim unclaimed edges of G(n, p), until all the edges are claimed. Maker wins if he claims all the edges of a k‐clique; Breaker wins otherwise. We determine that the threshold for the graph property that Maker can win this game is at , for all k > 3, thus proving a conjecture from Ref. [Stojakovi? and Szabó, Random Struct Algor 26 (2005), 204–223]. More precisely, we conclude that there exist constants such that when the game is Maker's win a.a.s., and when it is Breaker's win a.a.s. For the triangle game, when k = 3, we give a more precise result, describing the hitting time of Maker's win in the random graph process. We show that, with high probability, Maker can win the triangle game exactly at the time when a copy of K₅ with one edge removed appears in the random graph process. As a consequence, we are able to give an expression for the limiting probability of Maker's win in the triangle game played on the edge set of G(n, p). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 45, 318–341, 2014     

On complex n-folds polarized by an ample line bundle L with .

Let (X L) be a polarized manifold with dim X = n≥3 and dim Bs |L|≤0. In this paper, we classify (X,L) with _g(L) = q(X) +m and h^o(L) ≥ n + m.     

On complex manifolds polarized by an ample line bundle of sectional genus q ( X ) + 2

Let (X,L) be a polarized manifold with dim X = n. In this paper, we classify (X,L) with n = 3, , and g(L)=q(X) + 2. Moreover we also classify (X,L) with , g(L)=q(x) + 2, and . Received February 12, 1999     

Folding Wheels and Fans

 If two non-adjacent vertices of a connected graph that have a common neighbor are identified and the resulting multiple edges are reduced to simple edges, then we obtain another graph of order one less than that of the original graph. This process can be repeated until the resulting graph is complete. We say that we have folded the graph onto complete graph. This process of folding a connected graph G onto a complete graph induces in a very natural way a partition of the vertex-set of G. We denote by F(G) the set of all complete graphs onto which G can be folded. We show here that if p and q are the largest and smallest orders, respectively, of the complete graph in F(W _n ) or F(F _n ), then K _s is in F(W _n ) or F(F _n ) for each s, q≤s≤p. Lastly, we shall also determine the exact values of p and q. Received: October, 2001 Final version received: June 26, 2002     

Parabolic conjugacy in general linear groups

Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL _n (q). We show that the number of P(q)-conjugacy classes in GL _n (q) is, as a function of q, a polynomial in q with integer coefficients. This answers a question of Alperin in (Commun. Algebra 34(3): 889–891, 2006)     

A phase transition phenomenon in a random directed acyclic graph

Let a random directed acyclic graph be defined as being obtained from the random graph G_{n, p} by orienting the edges according to the ordering of vertices. Let γ_n* be the size of the largest (reflexive, transitive) closure of a vertex. For p=c(log n)/n, we prove that, with high probability, γ_n* is asymptotic to n^c log n, 2n(log log n)/log n, and n(1−1/c) depending on whether c<1, c=1, or c>1. We also determine the limiting distribution of the first vertex closure in all three ranges of c. As an application, we show that the expected number of comparable pairs is asymptotic to n^1+c/c log n, ½(n(log log n)/log n)², and ½(n(1−1/c))², respectively. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 164–184, 2001     

The phase transition in the cluster‐scaled model of a random graph

For 0 < p < 1 and q > 0 let G_q(n,p) denote the random graph with vertex set [n]={1,…,n} such that, for each graph G on [n] with e(G) edges and c(G) components, the probability that G_q(n,p)=G is proportional to . The first systematic study of G_q(n,p) was undertaken by 6 , who analyzed the phase transition phenomenon corresponding to the emergence of the giant component. In this paper we describe the structure of G_q(n,p) very close the critical threshold. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Diameters of finite upper half plane graphs

Let GF(q) be a finite field of q elements. Let G denote the group of matrices M(x, y) = (^{y x}_{0 1}) over GF(q) with y ≠ 0. Fix an irreducible polynomial For each a ϵ GF(q), let X_a be the graph whose vertices are the q² − q elements of G, with two vertices M(x, y), M(v, w) joined by an edge if and only if The graphs X_a with a ϵ/ {0, t² − 4n} are (q + 1)-regular connected graphs which have received recent attention, as they've been shown to be Ramanujan graphs. We determine the diameter of these graphs X_a. © 1996 John Wiley & Sons, Inc.     

On the spectral characterization of some unicyclic graphs

Let H(n;q,n₁,n₂) be a graph with n vertices containing a cycle C_q and two hanging paths P_n1 and P_n2 attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12;6,1,5) and H(12;8,2,2), no two non-isomorphic graphs of the form H(n;q,n₁,n₂) are A-cospectral. It is proved that all graphs H(n;q,n₁,n₂) are determined by their L-spectra. And all graphs H(n;q,n₁,n₂) are proved to be determined by their Q-spectra, except for graphs with a being a positive even number and with b≥4 being an even number. Moreover, the Q-cospectral graphs with these two exceptions are given.     

A characterization of Grassmann graphs

Let q be a prime power and suppose that e and n are integers satisfying 1 e n − 1. Then the Grassmann graph Γ(e, q, n) has as vertices the e-dimensional subspaces of a vector space of dimension n over the field F_q, where two vertices are adjacent iff they meet in a subspace of dimension e − 1. In this paper, a characterization of Γ(e, q, n) in terms of parameters is obtained provided that and ( if q ε {2, 3}) and if q = 3). As a consequence we can show that these Grassmann graphs are uniquely determined as distance-regular graphs by their intersection arrays.     

Gargano,Lewinter and Malerba问题的解

§1　IntroductionLet G be a graph with vertex-set V(G) ={ v1 ,v2 ,...,vn} .A labeling of G is a bijectionL:V(G)→{ 1,2 ,...,n} ,where L (vi) is the label of a vertex vi.A labeled graph is anordered pair (G,L) consisting of a graph G and its labeling L.Definition1.An increasing nonconsecutive path in a labeled graph(G,L) is a path(u1 ,u2 ,...,uk) in G such thatL(ui) + 1相似文献   

Some results on the achromatic number

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ≤ m. We show that the problem of determining the achromatic number of a tree is NP-hard. We further prove that almost all trees T satisfy ψ (T) = q(m), where m is the number of edges in T. Lastly, for fixed d and ϵ > 0, we show that there is an integer N₀ = N₀(d, ϵ) such that if G is a graph with maximum degree at most d, and m ≥ N₀ edges, then (1 - ϵ)q(m) ≤ ψ (G) ≤ q(m). © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 129–136, 1997     

A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

Unipotent Conjugacy in General Linear Groups

Let U(n,q) be the group of upper uni-triangular matrices in GL(n,q), the n-dimensional general linear group over the field of q elements. The number of U(n,q)-conjugacy classes in GL(n,q) is, as a function of q, for fixed n, a polynomial in q with integral coefficients.     

Korovkin-type theorem and application

Let (L_n) be a sequence of positive linear operators on C[0,1], satisfying that (L_n(e_i)) converge in C[0,1] (not necessarily to e_i) for i=0,1,2, where e_i(x)=xⁱ. We prove that the conditions that (L_n) is monotonicity-preserving, convexity-preserving and variation diminishing do not suffice to insure the convergence of (L_n(f)) for all fC[0,1]. We obtain the Korovkin-type theorem and give quantitative results for the approximation properties of the q-Bernstein operators B_n,q as an application.     

Polynomial Invariants of Certain Pseudo-Symplectic Groups Over Finite Fields of Characteristic Two

Let F _q be a finite field of characteristic two, S be a nonsingular non-alternate symmetric matrix over F _q and Ps _n (F _q , S) be the associated pseudo-symplectic group. Let Ps _n (F _q , S) act linearly on the polynomial ring F _q [x ₁,…, x _n ]. In this note, we find an explicit set of generators of the ring of invariants of Ps _n (F _q , S) for n = 2, 4 and 2ν +1. In particular, the results assert that the ring of invariants of Ps ₄(F _q , S) is not a polynomial algebra but is an example of hypersurface and the ring of invariants of Ps _2ν+1(F _q , S) is a complete intersection.     

Orlicz-Hardy spaces associated with operators

Let L be a linear operator in L2(Rn) and generate an analytic semigroup {e-tL}t 0 with kernel satisfying an upper bound of Poisson type, whose decay is measured by θ(L) ∈ (0, ∞). Let ω on (0, ∞) be of upper type 1 and of critical lower type p0(ω) ∈ (n/(n + θ(L)), 1] and ρ(t) = t-1/ω-1(t-1) for t ∈ (0, ∞). We introduce the Orlicz-Hardy space Hω, L(Rn) and the BMO-type space BMOρ, L(Rn) and establish the John-Nirenberg inequality for BMOρ, L(Rn) functions and the duality relation between Hω, L(Rn) and BMOρ, L...     

On the Diameter of Wenger Graphs

Let q be a prime power, the field of q elements, and n≥1 a positive integer. The Wenger graph W _n (q) is defined as follows: the vertex set of W _n (q) is the union of two copies P and L of (n+1)-dimensional vector spaces over , with two vertices (p ₁,p ₂,…,p _n+1)∈P and [l ₁,l ₂,…,l _n+1]∈L being adjacent if and only if l _i +p _i =p ₁ l _i−1 for 2≤i≤n+1. Graphs W _n (q) have several interesting properties. In particular, it is known that when connected, their diameter is at most 2n+2. In this note we prove that the diameter of connected Wenger graphs is 2n+2 under the assumption that 1≤n≤q−1.     

Lattices Generated by Orbits of Flats Under Finite Affine Groups

Let AG(n, _q ) be the n-dimensional affine space over  _q . For a given integer m with 0 ≤ m ≤ n, all m-flats form an orbit, denoted by ?(m,n), under the action of the affine group AGL _n ( _q ) of AG(n, _q ). Denote the set of all intersections of m-flats in ?(m,n) by ?(m,n). By ordering ?(m,n) by ordinary or reverse inclusion, two classes of lattices are obtained. This article discusses their geometricity, and computes their character polynomials.