Results 11 to 20 of about 605,731 (305)
Proceedings of the London Mathematical Society, 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 satisfied by an asymptotically unique graph.
Grzesik, Andrzej +2 more
openaire +7 more sources
Extremal graphs for homomorphisms [PDF]
Journal of Graph Theory, 2011 Summary: The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph \(G\) into a fixed image graph \(H\).
Jonathan Cutler, A. J. Radcliffe
openaire +1 more source
Some problems in extremal graph theory and finite geometry
, 2023 Lazebnik, FelixThis 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
Taranchuk, Vladislav
core +1 more source
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
Ars Mathematica Contemporanea, 2019 Summary: Let \(G\) be a ribbon graph and \(\mu (G)\) be the number of components of the virtual link formed from \(G\) as a cellularly embedded graph via the medial construction. In this paper we first prove that \(\mu (G) \leq f(G) + \gamma (G)\), where \(f(G)\) and \(\gamma (G)\) are the number of boundary components and Euler genus of \(G ...
Jin, Xian'an, Yan, Qi
openaire +3 more sources
Extremal optimization for graph partitioning [PDF]
Physical Review E, 2001 34 pages, RevTex4, 1 table and 20 ps-figures included, related papers available at http://www.physics.emory.edu/faculty/boettcher/
Stefan Boettcher, Allon G. Percus
openaire +4 more sources
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
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Timothy D. LeSaulnier, Douglas B. West
openaire +2 more sources
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
Mathematica Bohemica, 2018 Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Minjie Zhang, Shuchao Li
doaj +1 more source
Extreme Monophonic Graphs and Extreme Geodesic Graphs
Tamkang Journal of Mathematics, 2016 For a connected graph $G=(V,E)$ of order at least two, a chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A monophonic set of $G$ is a set $S$ of vertices such that every vertex of $G$ lies on a monophonic path joining some pair of vertices in $S$.
P. Titus, A.P Santhakumaran
openaire +2 more sources