Results 11 to 20 of about 34,690 (269)
On new results on extremal graph theory, theory of algebraic graphs, and their applications
Доповiдi Нацiональної академiї наук України, 2022 New explicit constructions of infinite families of finite small world graphs of large girth with well-defined projective limits which is an infinite tree are described.
V.O. Ustimenko
doaj +3 more sources
Guessing Numbers and Extremal Graph Theory
The Electronic Journal of Combinatorics, 2022 For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the colors of the vertices in its neighborhood.
Jo Martin, Puck Rombach
openaire +3 more sources
, 2020 We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is ...
Grzesik, Andrzej +2 more
core +2 more sources
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Triangles in Ks-saturated graphs with minimum degree t
Theory and Applications of Graphs, 2020 For $n \geq 15$, we prove that the minimum number of triangles in an $n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, and that there is a unique extremal graph.
Craig Timmons +3 more
doaj +1 more source
On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs [PDF]
Transactions on Combinatorics, 2022 In this paper, we delve into studying some relations between the structure of the cycles and spanning trees of a graph through the lens of its cycle and spanning tree hypergraphs which are hypergraphs with the edge set of the graph as their vertices ...
Alireza Mofidi
doaj +1 more source
A Unified Approach for Extremal General Exponential Multiplicative Zagreb Indices
Axioms, 2023 The study of the maximum and minimal characteristics of graphs is the focus of the significant field of mathematics known as extreme graph theory. Finding the biggest or smallest graphs that meet specified criteria is the main goal of this discipline ...
Rashad Ismail +4 more
doaj +1 more source
Short proofs of some extremal results [PDF]
, 2013 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck +11 more
core +5 more sources
On a problem in extremal graph theory
Journal of Combinatorial Theory, Series B, 1977 From the authors introduction. Let \(G(n,m)\) denote a graph \((V,E)\) with \(n\) vertices and \(m\) edges and \(K_1\) a complete graph with \(i\) vertices. \textit{P.Turán} proved that every \(G(n,T(n,k))\) contains a \(K_k\), where \[ T(n,k) = \frac{k-2}{2(k-1)}(n^2-r^2)+\binom r2+1, \] \(r\equiv n(\mod k-1)\) and \(0\leq r\leq k-2\).
D. T. Busolini, Paul Erdös
openaire +1 more source
Compactness results in extremal graph theory [PDF]
Combinatorica, 1982 (From the authors' abstract:) ``Let \(L\) be a given family of \dots 'prohibited graphs'. Let \(\text{ex}(n,L)\) denote the maximum number of edges a simple graph of order n can have without containing subgraphs from \(L\). A typical extremal graph problem is to determine \(\text{ex}(n,L)\), or, at least, to find good bounds on it.
Paul Erdös, Miklós Simonovits
openaire +2 more sources