Hypergraph Turán Numbers of Vertex Disjoint Cycles

The Turán number of a k-uniform hypergraph H,denoted by ex_k(n;H),is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph.Let C_l~((k)) denote the family of all k-uniform minimal cycles of length l;S(?₁,…,?_r) denote the family of hypergraphs consisting of unions of r vertex disjoint minimal cycles of length ?₁,…?_r,respectively,and C_l~((k))denote a k-uniform linear ...     

On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs

Let F(x)=∑∞n=1 Tsi,s2,...,sk(n)x^n be the generating function for the number,Ts1bs2,...,sk(n) of spanning trees in the circulant graph Cn(s1,S2,...,Sk).We show that F(x)is a rational function with integer coefficients satisfying the property F(x)=F(l/x).A similar result is also true for the circulant graphs C2n(s1,S2,....,Sk,n)of odd valency.We illustrate the obtained results by a series of examples.     

Complement of the reduced non-zero component graph of free semimodules

Let M be a finitely generated free semimodule over a semiring S with identity having invariant basis number property with a basis α={α₁,...,α_k}.The complement■of the reduced non-zero component graph■ of M,is the simple undirected graph with ■as the vertex set and such that there is an edge between two distinct vertices ■ and ■ if and only if there exists no i such that both a_i,b_i are non-zero.In this paper,we show that the graph■ ...     

The minimal measurement number for generalized conjugate phase retrieval

The generalized conjugate phase retrieval problem aims to reconstruct a complex signal x ∈ Cⁿ from quadratic measurements x*A₁x,...,x*A_mx,where A₁,...,A_m∈R^n×n are real symmetric matrices.The equivalent formulation for generalized conjugate phase retrieval along with the minimal measurement number required for accurate retrieval(up to a global phase factor as well as conjugacy) is derived in this paper.We present a set of nine vectors in R⁴ and prove that it is conjugate phase retrievable on C⁴.This result implies the measurement number bound 4n-6 is not optimal for some n,which confirms a conjecture in the article by Evans and Lai(2019).     

具有5n个点的完全5部图的分类及5图部的色性

§ 1　IntroductionAll graphs considered here are finite and simple.For notations and terminology notdefined here,we refer to [1].For a graph G,by V(G) and E(G) we mean the vertex- setand edge- setof G,respectively.By N3(G) we denote the number of triangles in G.L et S bea set of sedges in G.By G- S (or G- s) we denote the graph obtained from G by deletingall edges in S.L et K (n1 ,n2 ,...,nt) be a complete t- partite graph.We denote by K- sn1 ,n2 ,...,ntthe family of graphs which are …     

Hypergraph Turan Numbers of Vertex Disjoint Cycles

The Turan number of a k-uniform hypergraph H,denoted by exk(n;H),is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph.Let Cl(k)denote the family of all k-uniform minimal cycles of length l;S(l1,…,lr)denote the family of hypergraphs consisting of unions of r vertex disjoint minimal cycles of lengthl1,…lr,respectively,and Cl(k)denote a k-uniform linear cycle of length l.We determine precisely exk(n;S(l1,…,lr)and exk(n;Cl1(k),…,Cl1(k)for sufficiently large n.Our results extend recent results of Füredi and Jiang who determined the Turan numbers for single k-uniform minimal cycles and linear cycles.     

Dense 3-uniform hypergraphs containing a large clique

An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turán density of an γ-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free γ-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When γ=2 the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However,when r ≥ 3, it becomes much harder to estimate the Lagrangians of γ-uniform hypergraphs and to characterize the structure of all dense γ-uniform graphs. The main goal of this note is to give some sufficient conditions for3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t] and m edges containing [t-1]~(3),then G is dense if and only if m≥{t-2 3)+(t-2 2)+1. We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.     

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相似文献   

图的Augmented Zagreb 指数的界

Let G =(V, E) be a simple connected graph with n(n ≥ 3) vertices and m edges,with vertex degree sequence {d₁, d₂,..., d_n}. The augmented Zagreb index is defined as AZI =AZI(G)=∑ij∈E(didj/di+dj-2)³. Using the properties of inequality, we investigate the bounds of AZI for connected graphs, in particular unicyclic graphs in this paper, some useful conclusions are obtained.     

Induced Matching Number of the Plane Grid Graph

An induced matching M in a graph G is a matching such that V(M) induces a 1-regular subgraph of G. The induced matching number of a graph G, denoted by I M(G), is the maximum number r such that G has an induced matching of r edges. Induced matching number of Pm×Pn is investigated in this paper. The main results are as follows:(1) If at least one of m and n is even, then IM(Pm×Pn=[(mn)/4].(2) If m is odd, then     

Rainb ow Vertex-connection Numb er of Ladder and M¨obius Ladder

A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a rainbow u-v geodesic, then G is strong rainbow vertex-connected. The minimum number k for which there exists a k-vertex-coloring of G that results in a strongly rainbow vertex-connected graph is called the strong rainbow vertex-connection number of G, denoted by srvc(G). Observe that rvc(G) ≤ srvc(G) for any nontrivial connected graph G. In this paper, for a Ladder Ln, we determine the exact value of srvc(Ln) for n even. For n odd, upper and lower bounds of srvc(Ln) are obtained. We also give upper and lower bounds of the (strong) rainbow vertex-connection number of M¨obius Ladder.     

Finite Projective Geometries and Classification of the Weight Hierarchies of Codes （Ⅰ）

The weight hierarchy of a binary linear [n,κ] code C is the sequence (d1,d2,...,dκ), where dr is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries.The possible weight hierarchies in class A, B, C, D are determined in Part (Ⅰ). The possible weight hierarchies in class E, F, G, H, I are determined in Part (Ⅱ).     

Tur´an Problems for Berge-(k, p)-Fan Hypergraph*

Let F be a graph. A hypergraph H is Berge-F if there is a bijection f : E(F) → E(H) such that e ? f(e) for every e ∈ E(F). A hypergraph is Berge-F-free if it does not contain a subhypergraph isomorphic to a Berge-F hypergraph. The authors denote the maximum number of hyperedges in an n-vertex r-uniform Berge-F-free hypergraph by ex_r(n, Berge-F).A (k, p)-fan, denoted by F_k,p, is a graph on k(p ? 1) + 1 vertices consisting of k cliques with p vertices that intersect in exactly one common vertex. In this paper they determine the bounds of ex_r(n, Berge-F) when F is a (k, p)-fan for k ≥ 2, p ≥ 3 and r ≥ 3.     

STABILITY NUMBER IN SUBCLASSES OF P_5~-FREE GRAPHS

§1　IntroductionLet Pn,Cn,and Kn be the path,the cycle,and the complete graph of order n,respectively.The complete bipartite graph with cardinalities ofparts m and n is denoted byKm,n.Disjoint union of n copies of a graph G is denoted by n G;Gis the complement of agraph G.A setof pairwise non-adjacent vertices in a graph is called stable.A maximum stableset of a graph G has the largest cardinalityα( G) among all stable sets of G;α( G) is calledthe stability number of G.Let Z be a s…     

Burning Numbers of Barbells

Motivated by a discrete-time process intended to measure the speed of the spread of contagion in a graph,the burning number b(G) of a graph G,is defined as the smallest integer k for which there are vertices x₁,…,x_k such that for every vertex u of G,there exists i ∈ {1,…,k} with d_G(u,x_i) ≤ k-i,and d_G(x_i,x_j)≥j-i for any 1≤i相似文献   

The Number of Circles of a Maximum State of a Plane Graph with Applications

Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links,in this paper,we introduce a parameter s_max(G),which is the maximum number of circles of states of the link diagram D(G)corresponding to a plane(positive)graph G.We show that s_max(G)does not depend on the embedding of G and if G is a 4-edge-connected plane graph then s_max(G)is equal to the number of faces of G,which cover the results of S.Y.Liu and H.P.Zhang as special cases.     

Multicolored Bipartite Ramsey Numbers of Large Cycles

For an integer r≥ 2 and bipartite graphs H_i,where 1 ≤i≤r,the bipartite Ramsey number br(H₁,H₂,…,H_r) is the minimum integer N such that any r-edge coloring of the complete bipartite graph K_N,N contains a monochromatic subgraph isomorphic to H_i in color i for some 1≤i≤r.We show that if ■     

On Graph-Lagrangians and clique numbers of 3-uniform hypergraphs

The paper explores the connection of Graph-Lagrangians and its maximum cliques for 3-uniform hypergraphs.Motzkin and Straus showed that the Graph-Lagrangian of a graph is the Graph-Lagrangian of its maximum cliques.This connection provided a new proof of Turán classical result on the Turán density of complete graphs.Since then,Graph-Lagrangian has become a useful tool in extremal problems for hypergraphs.Peng and Zhao attempted to explore the relationship between the Graph-Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range.They showed that if G is a 3-uniform graph with m edges containing a clique of order t-1,then λ(G)=λ([t-1]~((3))) provided (t-13)≤m≤(t-13)+_(t-22).They also conjectured:If G is an r-uniform graph with m edges not containing a clique of order t-1,then λ(G)λ([t-1]~((r))) provided (t-1r)≤ m ≤(t-1r)+(t-2r-1).It has been shown that to verify this conjecture for 3-uniform graphs,it is sufficient to verify the conjecture for left-compressed 3-uniform graphs with m=t-13+t-22.Regarding this conjecture,we show: If G is a left-compressed 3-uniform graph on the vertex set [t] with m edges and |[t-1]~((3))\E(G)|=p,then λ(G)λ([t-1]~((3))) provided m=(t-13)+(t-22) and t≥17p/2+11.     

The limit case of a domination property

The domination number γ(G) of a connected graph G of order n is bounded below by(n+2-e(G))/ 3 , where (G) denotes the maximum number of leaves in any spanning tree of G. We show that (n+2-e(G))/ 3 = γ(G) if and only if there exists a tree T ∈ T ( G) ∩ R such that n1(T ) = e(G), where n1(T ) denotes the number of leaves of T1, R denotes the family of all trees in which the distance between any two distinct leaves is congruent to 2 modulo 3, and T (G) denotes the set composed by the spanning trees of G. As a consequence of the study, we show that if (n+2-e(G))/ 3 = γ(G), then there exists a minimum dominating set in G whose induced subgraph is an independent set. Finally, we characterize all unicyclic graphs G for which equality (n+2-e(G))/ 3= γ(G) holds and we show that the length of the unique cycle of any unicyclic graph G with (n+2-e(G))/ 3= γ(G) belongs to {4} ∪ {3 , 6, 9, . . . }.     

Mixing via the extended family

In this paper,the relationship between the extended family and several mixing properties in measuretheoretical dynamical systems is investigated.The extended family eF related to a given family F can be regarded as the collection of all sets obtained as"piecewise shifted"members of F.For a measure preserving transformation T on a Lebesgue space(X,B,μ),the sets of"accurate intersections of order k"defined below are studied,Nε(A0,A1,...,Ak)=n∈Z+:μk i=0T inAiμ(A0)μ(A1)μ(Ak)ε,for k∈N,A0,A1,...,Ak∈B and ε0.It is shown that if T is weakly mixing(mildly mixing)then for any k∈N,all the sets Nε(A0,A1,...,Ak)have Banach density 1(are in(eFip),i.e.,the dual of the extended family related to IP-sets).