Results 201 to 210 of about 24,841 (222)
Some of the next articles are maybe not open access.
EXTREMAL PROBLEMS IN GRAPH THEORY: A COMBINATORIAL OPTIMIZATION PERSPECTIVE
Advances and Applications in Discrete MathematicsThe extremal theory of graphs considers the study of how large or small a graph invariant may be, according to certain constraints. The field crosses the overlying with combinatorial optimization, in which optimal configurations are studied under discrete conditions.
R. Thangathamizh +2 more
openaire +1 more source
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
Unavoidable chromatic patterns in 2‐colorings of the complete graph
Journal of Graph Theory, 2021Yair Caro +2 more
exaly
Short proofs of some extremal results III
Random Structures and Algorithms, 2020David Conlon, Jacob Fox, Benny Sudakov
exaly
Classification of Near-Horizon Geometries of Extremal Black Holes
Living Reviews in Relativity, 2013Hari K Kunduri, James Lucietti
exaly