Results 221 to 230 of about 115,144,832 (243)

Some Problems in Algebraic and Extremal Graph Theory. [PDF]

, 2022
In this dissertation, we consider a wide range of problems in algebraic and extremal graph theory. In extremal graph theory, we will prove that the Tree Packing Conjecture is true for all sequences of trees that are \u27almost stars\u27; and we prove ...
Dobson, Edward Tauscher
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On an extremal inverse problem in graph theory

Journal of Applied and Industrial Mathematics, 2015
Summary: 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

AN EXTREMAL PROBLEM IN GRAPH THEORY

The Quarterly Journal of Mathematics, 1980
Abbott, H. L., Hanson, D., Liu, A. C.
openaire   +1 more source

Some problems in extremal graph theory avoiding the use of the regularity lemma

2009
In 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

On an extremal inverse problem in the graph theory

Diskretnyi analiz i issledovanie operatsii, 2015
Dainiak, A. B., Kurnosov, A. D.
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 Extremal, Algorithmic, and Inferential Problems in Graph Theory.

In this dissertation we study a variety of graph-theoretic problems lying at the intersection of mathematics, computer science, and statistics. This work consists of three parts, each of which is in turn split into a number of chapters. While each part and the chapters therein are largely independent from each other, certain common themes feature ...
openaire   +1 more source

On an extremal problem concerning the theory of graphs

Archiv der Mathematik, 1981
openaire   +1 more source

Extremal infinite graph theory

Discrete Mathematics, 2011
Maya Stein
exaly  

Three conjectures in extremal spectral graph theory

Journal of Combinatorial Theory Series B, 2017
Michael Tait
exaly