Results 181 to 190 of about 455 (208)
Some of the next articles are maybe not open access.
Extremal problems in graph theory
Journal of Graph Theory, 1977AbstractThe aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.
exaly +3 more sources
On some extremal problems in graph theory
Israel Journal of Mathematics, 1965Der Verf. beweist, daß für eine genügend große Konstante \(c\) jeder Graph \(G\) mit \(n\) Punkten und \(cn^{3/2}\) Kanten ein Sechseck \(x_1,x_2,x_3,x_4,x_5,x_6\) enthält und dazu noch einen siebenten Punkt \(y\), der mit \(x_1,x_3\) und \(x_5\) verbunden ist.
Erdos P
exaly +3 more sources
On an extremal inverse problem in graph theory
Journal of Applied and Industrial Mathematics, 2015Summary: We consider the problem of constructing a graph having some given number of independent sets. The bounds are obtained for the number of vertices in bipartite graphs with the prescribed number of independent sets and for the number of inclusion maximal independent sets.
Daĭnyak, A. B., Kurnosov, A. D.
openaire +2 more sources
Some problems in extremal graph theory and finite geometry
2023This thesis is devoted to the study of several problems in extremal graph theory and finite geometry. We study properties such as girth, spectrum, and automorphism group of various families of algebraically defined graphs. We present a new and shorter proof of the girth of the family of graphs D(n, q). We also determine the asymptotics of the number of
openaire +2 more sources
Some problems in extremal graph theory avoiding the use of the regularity lemma
2009In this thesis we present two results in Extremal Graph Theory. The first result is a new proof of a conjecture of Bollobas on embedding trees of bounded degree. The second result is a new proof of the Posa conjecture.Let G=(W,E) be a graph on n vertices having minimum degree at least n/2 + c log(n), where c is a constant.
openaire +1 more source
AN EXTREMAL PROBLEM IN GRAPH THEORY
The Quarterly Journal of Mathematics, 1980Abbott, H. L., Hanson, D., Liu, A. C.
openaire +1 more source
Problems in Discrete Geometry, Incidence Geometry,and Extremal Graph Theory
In this thesis, we study several problems from discrete geometry, incidence geometry, and extremal graph theory. In Chapter 1, we discuss some results in discrete geometry. We study three different but similar discrete geometry problems, which share a similar idea on constructions.openaire +1 more source
On an extremal inverse problem in the graph theory
Diskretnyi analiz i issledovanie operatsii, 2015Dainiak, A. B., Kurnosov, A. D.
openaire +1 more source

