Results 1  10
of
91,096
Complete subgraphs of random graphs
, 2002
"... A classical theorem by Erdős, Kleitman and Rothschild on the structure of trianglefree graphs states that with high probability such graphs are bipartite. Our first main result refines this theorem by investigating the structure of the ’few ’ trianglefree graphs which are not bipartite. We prove t ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
that a fixed subgraph H occurs with extremely high probability in sufficiently dense εregular graphs. We prove this conjecture for the
Complete subgraphs in multipartite graphs
"... Turán’s Theorem states that every graphG of edge density ‖G‖/(G2)> k−2k−1 contains a complete graph Kk and describes the unique extremal graphs. We give a similar Theorem for `partite graphs. For large `, we find the minimal edge density dk ` , such that every `partite graph whose parts have ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Turán’s Theorem states that every graphG of edge density ‖G‖/(G2)> k−2k−1 contains a complete graph Kk and describes the unique extremal graphs. We give a similar Theorem for `partite graphs. For large `, we find the minimal edge density dk ` , such that every `partite graph whose parts
On Vertexdisjoint Complete Subgraphs of a Graph
"... We conjecture that if G is a graph of order sk, where s ~3 and k 2: 1 are integers, and d(x)+d(y) ~ 2(s1)k for every pair of nonadjacent vertices x and y of G, then G contains k vertexdisjoint complete subgraphs of order s. This is true when s = 3, [6]. Here we prove this conjecture for k ~ 6. 1 ..."
Abstract
 Add to MetaCart
We conjecture that if G is a graph of order sk, where s ~3 and k 2: 1 are integers, and d(x)+d(y) ~ 2(s1)k for every pair of nonadjacent vertices x and y of G, then G contains k vertexdisjoint complete subgraphs of order s. This is true when s = 3, [6]. Here we prove this conjecture for k ~ 6
The Existence of Exactly mcoloured Complete Subgraphs
, 1996
"... this paper we will describe our main new method for constructing counterexamples. This will enable us to prove the following result. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper we will describe our main new method for constructing counterexamples. This will enable us to prove the following result.
ON THE NUMBER OF COMPLETE SUBGRAPHS AND CIRCUITS CONTAINED IN GRAPHS
, 1968
"... Dedicated to V. JARNiK on the occasion of his 70th birthday. Denote by W(n; k) a graph of n vertices and k edges. Put for n r (mod p 1) m(n,p) = p2 (n 2r 2)+ ( r), 0<_n_<p1 2(p 1) 22 and denote by K P the complete graph of p vertices. A well known theorem of TUR.áN [6] states that every ..."
Abstract
 Add to MetaCart
Dedicated to V. JARNiK on the occasion of his 70th birthday. Denote by W(n; k) a graph of n vertices and k edges. Put for n r (mod p 1) m(n,p) = p2 (n 2r 2)+ ( r), 0<_n_<p1 2(p 1) 22 and denote by K P the complete graph of p vertices. A well known theorem of TUR.áN [6] states
12 On Induced Subgraphs of Finite Graphs not Containing Large Empty and Complete Subgraphs
, 2014
"... ar ..."
Frequent Subgraph Discovery
, 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to nontraditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract

Cited by 407 (14 self)
 Add to MetaCart
of these domains. An alternate way of modeling the objects in these data sets, is to use a graph to model the database objects. Within that model, the problem of finding frequent patterns becomes that of discovering subgraphs that occur frequently over the entire set of graphs. In this paper we present a
Ramsey problem on Multiplicities of Complete Subgraphs in Nearly Quasirandom Graphs.
"... Let kt(G) be the number of cliques of order t in the graph G. For a graph G with n vertices let ct(G) = kt(G)+kt ( ¯ G) ( n. Let ct(n) = t) Min{ct(G) : G  = n} and let ct = limn→ ∞ ct(n). An old conjecture of Erdös [2] related to Ramsey’s theorem states that ct = 2 1−(t 2). Recently it was show ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Let kt(G) be the number of cliques of order t in the graph G. For a graph G with n vertices let ct(G) = kt(G)+kt ( ¯ G) ( n. Let ct(n) = t) Min{ct(G) : G  = n} and let ct = limn→ ∞ ct(n). An old conjecture of Erdös [2] related to Ramsey’s theorem states that ct = 2 1−(t 2). Recently it was shown to be false by A. Thomason [12]. It is known that ct(G) ∼ 2 1−(t 2) whenever G is a pseudorandom graph. Pseudorandom graphs the graphs ”which behave like random graphs ”were introduced and studied in [1] and [13]. The aim of this paper is to show that for t = 4, ct(G) ≥ 2 1−(t 2) if G is a graph arising from pseudorandom by a small perturbation. 1 Introduction. Denote by kt(G) the number of cliques of order t in the graph G. For a graph
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 664 (14 self)
 Add to MetaCart
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing
Results 1  10
of
91,096