Results 191 to 200 of about 24,841 (222)

Extending the hyper‐logistic model to the random setting: New theoretical results with real‐world applications

Mathematical Methods in the Applied Sciences, EarlyView.
We develop a full randomization of the classical hyper‐logistic growth model by obtaining closed‐form expressions for relevant quantities of interest, such as the first probability density function of its solution, the time until a given fixed population is reached, and the population at the inflection point.
Juan Carlos Cortés, Ana Navarro‐Quiles, Sorina Madalina Sferle   +2 more
wiley   +1 more source

A new framework for X-ray absorption spectroscopy data analysis based on machine learning: XASDAML. [PDF]

J Synchrotron Radiat
Han X, Yao H, Zhan F, Song X, Zhao J, Zhao H.   +5 more
europepmc   +1 more source

Extremal problems in graph theory and a hypergraph packing problem

openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
Paul Erdos
openaire   +4 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.
openaire   +4 more sources

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.
openaire   +4 more sources

Two problems in extremal graph theory

Graphs and Combinatorics, 1986
Paul Erdos
openaire   +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.
Daĭnyak, A. B., Kurnosov, A. D.
openaire   +2 more sources

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