Results 31 to 40 of about 25,547 (250)
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
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
Extremal problems for the p-spectral radius of graphs [PDF]
, 2014 The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{ and }\left ...
Kang, Liying, Nikiforov, Vladimir
core +1 more source
Expanding graphs of the Extremal Graph Theory and expanded platforms of Post Quantum Cryptography
Conference on Computer Science and Information Systems, 2019 Explicit constructions in Extremal Graph Theory give appropriate lower bounds for Turan type problems. In the case of prohibited cycles, the explicit constructions can be used for various problems of Information Security.
V. Ustimenko +2 more
semanticscholar +1 more source
A proof of the stability of extremal graphs, Simonovits' stability from Szemer\'edi's regularity [PDF]
, 2015 The following sharpening of Tur\'an's theorem is proved. Let $T_{n,p}$ denote the complete $p$--partite graph of order $n$ having the maximum number of edges. If $G$ is an $n$-vertex $K_{p+1}$-free graph with $e(T_{n,p})-t$ edges then there exists an (at
Füredi, Zoltán
core +2 more sources
Optimal transportation, topology and uniqueness [PDF]
, 2010 The Monge-Kantorovich transportation problem involves optimizing with respect to a given a cost function. Uniqueness is a fundamental open question about which little is known when the cost function is smooth and the landscapes containing the goods to be
Ahmad, Najma +2 more
core +4 more sources
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
Stability for large forbidden subgraphs [PDF]
, 2007 We extend the classical stability theorem of Erdos and Simonovits for forbidden graphs of logarithmic order.Comment: Some polishing.
Bollobás +6 more
core +3 more sources
Advanced Functional Materials, EarlyView.A lack of standard approaches for testing and reporting the performance of metal halide perovskites and organic semiconductor radiation detectors has resulted in inconsistent interpretation of performance parameters, impeding progress in the field. This Perspective recommends key metrics and experimental details, which are suggested for reporting in ...
Jessie A. Posar +8 more
wiley +1 more source