Results 201 to 210 of about 24,814 (240)

An extremal problem in graph theory

Israel Journal of Mathematics, 1968
It is proved that the maximum number of cut-vertices in a connected graph withn vertices andm edges is $$max\left\{ {q:m \leqq (_2^{n - q} ) + q} \right\}$$ All the extremal graphs are determined and the corresponding problem for cut-edges is also solved.
A. Ramachandra Rao
openalex   +3 more sources

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.
A. B. Dainyak, A. D. Kurnosov
openalex   +3 more sources

Extremal problems in graph theory

Journal of Graph Theory, 1977
AbstractThe aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.
Béla Bollobás
openalex   +3 more sources

On some extremal problems in graph theory

Israel Journal of Mathematics, 1965
Der 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.
P. Erdös
openalex   +3 more sources

AN EXTREMAL PROBLEM IN GRAPH THEORY

The Quarterly Journal of Mathematics, 1980
H. L. Abbott, D. Hanson, A. C. LIU
openalex   +2 more sources

Two problems in extremal graph theory

Graphs and Combinatorics, 1986
Paul Erdős
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Some problems in extremal graph theory and finite geometry

2023
This 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

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, 2015
Dainiak, A. B., Kurnosov, A. D.
openaire   +1 more source

Poly(ADP-Ribose) polymerase (PARP) inhibitors: Exploiting a synthetic lethal strategy in the clinic

Ca-A Cancer Journal for Clinicians, 2011
Timothy A Yap, Johann Sebastian de Bono
exaly