Results 11 to 20 of about 115,144,832 (243)
Two Extremal Problems in Graph Theory
The Electronic Journal of Combinatorics, 1994 We consider the following two problems. (1) Let $t$ and $n$ be positive integers with $n\geq t\geq 2$. Determine the maximum number of edges of a graph of order $n$ that contains neither $K_t$ nor $K_{t,t}$ as a subgraph. (2) Let $r$, $t$ and $n$ be positive integers with $n\geq rt$ and $t\geq 2$. Determine the maximum number of edges of a graph of
Richard A. Brualdi, Stephen Mellendorf
openaire +3 more sources
Problems in Ramsey theory, probabilistic combinatorics and extremal graph theory [PDF]
, 2015 In this dissertation, we treat several problems in Ramsey theory, probabilistic combinatorics and extremal graph theory.
Narayanan, Bhargav
core +4 more sources
Problems in extremal graph theory and Euclidean Ramsey theory.
, 2019 This thesis addresses problems of three types. The first type is finding extremal numbers for unions of graphs, each with a colour-critical edge (joint work with V. Nikiforov). In 1968, Simonovits found extremal numbers $ex(n,H)$ for graphs with a colour-critical edge for large $n$ (without specifying how large).
Tsaturian, Sergei
openaire +3 more sources
On the conjunctive capacity of graphs [PDF]
, 2013 The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka +5 more
core +1 more source
Finitely forcible graphons with an almost arbitrary structure
Discrete Analysis, 2020 Finitely forcible graphons with an almost arbitrary structure, Discrete Analysis 2020:9, 36 pp. A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if $G$ is a graph with $n$ vertices and density $p$, and if the number ...
Daniel Kral +3 more
doaj +1 more source
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
On a valence problem in extremal graph theory
Discrete Mathematics, 1973 Vorliegende Arbeit bezieht sich auf nicht-orientierte, Schlingen und mehrfache Kanten nicht enhaltende Graphen. Bezeichne \(L\) einen solchen vom vollständigen \(p\)-Graphen \(K_p\) verschiedenen \(p\)-chromatischen Graphen, welcher eine Kante \(e\) so enthält, daß \(L-e\) ein \((p-1)\)-chromatischer Graph ist. Als Hauptergebnis der vorliegenden Arbeit
Paul Erdös, Miklós Simonovits
openaire +3 more sources
Proofs by Transformation in Extremal Graph Theory [PDF]
, 2022 A graph is a mathematical model representing binary relationships between elements of a set. It is composed of two sets: the set of the elements called the vertices and a set of pairs of vertices called the edges.
Devillez, Gauvain
core +1 more source
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
Maximum Cycle Packing in Eulerian Graphs Using Local Traces
Discussiones Mathematicae Graph Theory, 2015 For a graph G = (V,E) and a vertex v ∈ V , let T(v) be a local trace at v, i.e. T(v) is an Eulerian subgraph of G such that every walk W(v), with start vertex v can be extended to an Eulerian tour in T(v).
Recht Peter, Sprengel Eva-Maria
doaj +1 more source