DOIAbstract
AbstractThe maximum number of edges in a graph with no constant degree clique of a fixed size is determined asymptotically
AbstractThe maximum number of edges in a graph with no constant degree clique of a fixed size is determined asymptotically
For a graph G whose degree sequence is d1,...,dn, and for a positive integer p, let ep(G) = �n i=1 ...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
AbstractWe answer a question of Erdös, Faudree, Reid, Schelp and Staton by showing that for every in...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
We answer a question of Erdos, Faudree, Reid, Schelp and Staton by showing that for every integer k ...
We determine the maximum number of edges that a planar graph can have as a function of its maximum d...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
For every graph G, let Δr (G) = max{∑ uεRd (u) : R is an r-clique of G} and let Δr (n, m) be the min...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
AbstractLet f(n) denote the maximum number of edges of a graph on n vertices not containing a circui...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
Let f (n, m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m ed...
For a graph G whose degree sequence is d1,...,dn, and for a positive integer p, let ep(G) = �n i=1 ...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ...
AbstractWe answer a question of Erdös, Faudree, Reid, Schelp and Staton by showing that for every in...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
We answer a question of Erdos, Faudree, Reid, Schelp and Staton by showing that for every integer k ...
We determine the maximum number of edges that a planar graph can have as a function of its maximum d...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
For every graph G, let Δr (G) = max{∑ uεRd (u) : R is an r-clique of G} and let Δr (n, m) be the min...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
AbstractLet f(n) denote the maximum number of edges of a graph on n vertices not containing a circui...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
Let f (n, m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m ed...
For a graph G whose degree sequence is d1,...,dn, and for a positive integer p, let ep(G) = �n i=1 ...
Let k := (k1),. . .,ks) be a sequence of natural numbers. For a graph G, let F(G;k) denote the numbe...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
Add to ORKG