K 4-free graphs without large induced triangle-free subgraphs

Let f _3,4(n), for a natural number n, be the largest integer m such that every K ₄-free graph of order n contains an induced triangle-free subgraph of order m. We prove that for every suffciently large n, f _3,4(n)≤n ^1/2(lnn)¹²⁰. By known results, this bound is tight up to a polylogarithmic factor.     

A multiplicative inequality for vertex Folkman numbers

Let G be a graph and a₁,…,a_r be positive integers. The symbol G→(a₁,…,a_r) denotes that in every r-coloring of the vertex set V(G) there exists a monochromatic a_i-clique of color i for some i∈{1,…,r}. The vertex Folkman numbers F(a₁,…,a_r;q)=min{|V(G)|:G→(a₁,…,a_r) and K_q?G} are considered. Let a_i, b_i, c_i, i∈{1,…,r}, s, t be positive integers and c_i=a_ib_i, 1?a_i?s,1?b_i?t. Then we prove that

F(c₁,c₂,…,c_r;st+1)?F(a₁,a₂,…,a_r;s+1)F(b₁,b₂,…,b_r;t+1).     

Some remarks on vertex Folkman numbers for hypergraphs

Let $F(r,G)$ be the least order of $H$ such that the clique numbers of $H$ and $G$ are equal and any $r$-coloring of the vertices of $H$ yields a monochromatic and induced copy of $G$. The problem of bounding of $F(r,G)$ was studied by several authors and it is well understood. In this note, we extend those results to uniform hypergraphs.     

Sylow subgraphs in self-complementary vertex transitive graphs

A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if for each choice of vertices u and $v$ there is an automorphism that carries the vertex u to $v$. The number of vertices in a self-complementary vertex-transitive graph must necessarily be congruent to 1 mod 4. However, Muzychuk has shown that if $p^m$ is the largest power of a prime p dividing the order of a self-complementary vertex-transitive graph, then $p^m$ must individually be congruent to 1 mod 4. This is accomplished by establishing the existence of a self-complementary vertex transitive subgraph of order $p^m$, a result reminiscent of the Sylow theorems. This article is a self-contained survey, culminating with a detailed proof of Muzychuk's result.     

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.     

On the maximal number of certain subgraphs inK r -free graphs

Given two graphsH andG, letH(G) denote the number of subgraphs ofG isomorphic toH. We prove that ifH is a bipartite graph with a one-factor, then for every triangle-free graphG withn verticesH(G) H(T ₂(n)), whereT ₂(n) denotes the complete bipartite graph ofn vertices whose colour classes are as equal as possible. We also prove that ifK is a completet-partite graph ofm vertices,r > t, n max(m, r – 1), then there exists a complete (r – 1)-partite graphG* withn vertices such thatK(G) K(G*) holds for everyK _r -free graphG withn vertices. In particular, in the class of allK _r -free graphs withn vertices the complete balanced (r – 1)-partite graphT _r–1(n) has the largest number of subgraphs isomorphic toK _t (t < r),C ₄,K _2,3. These generalize some theorems of Turán, Erdös and Sauer.Dedicated to Paul Turán on his 80th Birthday     

On graphs with subgraphs having large independence numbers

Let G be a graph on n vertices in which every induced subgraph on vertices has an independent set of size at least . What is the largest so that every such G must contain an independent set of size at least q? This is one of the several related questions raised by Erd?s and Hajnal. We show that , investigate the more general problem obtained by changing the parameters s and t, and discuss the connection to a related Ramsey‐type problem. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 149–157, 2007     

On induced Folkman numbers

In 1970, Folkman proved that for any graph G there exists a graph H with the same clique number as G. In addition, any r ‐coloring of the vertices of H yields a monochromatic copy of G. For a given graph G and a number of colors r let f(G, r) be the order of the smallest graph H with the above properties. In this paper, we give a relatively small upper bound on f(G, r) as a function of the order of G and its clique number. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 40, 493–500, 2012     

On graphs critical with respect to vertex partition numbers

For k?0, ?_k(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, k)-critical if it is connected and for each edge e of G?_k(G–e)<?_k(G)=n. We describe all (2, k)-critical graphs and for n?3,k?1 we extend and simplify a result of Bollobás and Harary giving one construction of a family of (n, k)-critical graphs of every possible order.     

图的符号星k控制数

引入了图的符号星k控制的概念.设G=（V,E）是一个图,一个函数f：E→{-1,＋1},如果∑e∈E[v]f（e）≥1对于至少k个顶点v∈V（G）成立,则称f为图G的一个符号星k控制函数,其中E（v）表示G中与v点相关联的边集.图G的符号星k控制数定义为γkss（G）=min{∑e∈Ef（e）｜f为图G的符号星k控制函数}.在本文中,我们主要给出了一般图的符号星k控制数的若干下界,推广了关于符号星控制的一个结果,并确定路和圈的符号星k控制数.     

On c+-chromatic graphs with small bounded subgraphs

It is shown that if ZF is consistent then so is ZFC+2 is as large as you wish + there is a graph with cardinality and chromatic number (2) + such that every subgraph of cardinality 2 has chromatic number .The preparation of this paper was supported by Hungarian National Foundation for Scientific Research (OTKA), grant no. 1805.     

Hamiltonian results in K1,3-free graphs

There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K_1,3-free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K_1,3-free graphs.     

Regular factors in K1,3-free graphs

We show that every connected K_1,3-free graph with minimum degree at least 2k contains a k-factor and construct connected K_1,3-free graphs with minimum degree k + 0(√k) that have no k-factor.     

On partitions of K2,3-free graphs under degree constraints

Suppose that $s$, $t$ are two positive integers, and $?$ is a set of graphs. Let $g(s,t;?)$ be the least integer $g$ such that any $?$-free graph with minimum degree at least $g$ can be partitioned into two sets which induced subgraphs have minimum degree at least $s$ and $t$, respectively. For a given graph $H$, we simply write $g(s,t;H)$ for $g(s,t;?)$ when $?=\left\{H\right\}$. In this paper, we show that if $s,t\ge 2$, then $g(s,t;K_{2,3})\le s+t$ and $g(s,t;\{K_3,C_8,K_{2,3}\})\le s+t?1$. Moreover, if $?$ is the set of graphs obtained by connecting a single vertex to exactly two vertices of $K_4?e$, then $g(s,t;?)\le s+t$ on $?$-free graphs with at least five vertices, which generalize a result of Liu and Xu (2017).     

Independence numbers of random subgraphs of distance graphs

We consider the distance graph G(n, r, s), whose vertices can be identified with r-element subsets of the set {1, 2,..., n}, two arbitrary vertices being joined by an edge if and only if the cardinality of the intersection of the corresponding subsets is s. For s = 0, such graphs are known as Kneser graphs. These graphs are closely related to the Erd?s–Ko–Rado problem and also play an important role in combinatorial geometry and coding theory. We study some properties of random subgraphs of G(n, r, s) in the Erd?s–Rényi model, in which every edge occurs in the subgraph with some given probability p independently of the other edges. We find the asymptotics of the independence number of a random subgraph of G(n, r, s) for the case of constant r and s. The independence number of a random subgraph is Θ(log₂n) times as large as that of the graph G(n, r, s) itself for r ≤ 2s + 1, while for r > 2s + 1 one has asymptotic stability: the two independence numbers asymptotically coincide.     

On (Kq,k) vertex stable graphs with minimum size

A graph $G$ is a $(K_q,k)$ vertex stable graph if it contains a $K_q$ after deleting any subset of $k$ vertices. We give a characterization of $(K_q,k)$ vertex stable graphs with minimum size for $q=3,4,5$.