Results 11 to 20 of about 5,888,750 (277)
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Entropy (Basel), 2022 The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties.
Sason I.
europepmc +4 more sources
Extremal infinite graph theory [PDF]
Discrete Mathematics, 2011 We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
Maya Stein
exaly +6 more sources
Extremal graph theory and finite forcibility [PDF]
Electronic Notes in Discrete Mathematics, 2017 We study the uniqueness of optimal solutions to extremal graph theory problems. Our main result is a counterexample to the following conjecture of Lov´asz, which is often referred to as saying that “every extremal graph theory problem has a finitely forcible optimum”: every finite feasible set of subgraph density constraints can be extended further by ...
Daniel Kral +2 more
exaly +4 more sources
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
Yugoslav Journal of Operations Research, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
doaj +3 more sources
On an extremal problem in graph theory [PDF]
Colloquium Mathematicum, 1964 Let \(l\) and \(p\) be integers such that \(l>p\). It is shown that there exists a constant \(\gamma_{p,l}\) such that if \(n>n_0(p,l)\) then every graph with \(n\) vertices and \([\gamma_{p,l}n^{2-1/p}]\) edges contains a subgraph \(H\) with the following property: the vertices of \(H\) may be labbeled \(x_1,...,x_l\) and \(y_1,...,y_l\) so that every
exaly +3 more sources
Extremal Graph Theory for Metric Dimension and Diameter [PDF]
Electronic Notes in Discrete Mathematics, 2007 A set of vertices $S$ resolves a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. Let ${\cal G}_{\beta,D}$ be the set of graphs with metric dimension $\beta$ and diameter $D$.
Mercè Mora +2 more
exaly +8 more sources
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
Rational exponents in extremal graph theory [PDF]
Journal of the European Mathematical Society, 2018 Given a family of graphs \mathcal{H} , the extremal number ex (n, \mathcal{H}) is the largest m
Bukh, Boris, Conlon, David
openaire +6 more sources
Three conjectures in extremal spectral graph theory
Journal of Combinatorial Theory Series B, 2017 We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of $P_2$ and $P_{n-2}$ is the unique graph of maximum spectral radius over all planar graphs. This was conjectured by Boots and Royle in 1991 and independently by Cao and Vince in 1993.
Michael Tait
exaly +4 more sources
On the applications of Extremal Graph Theory to Coding Theory and Cryptography
Electronic Notes in Discrete Mathematics, 2013 <p>Explicit constructions in Extremal graph theory give appropriate lower bound for Turan type problems. In the case of prohibited cycles explicit constructions can be used in various problems of Information Security. We observe algebraic constructions of regular graphs of large girth and graphs with large cycle indicator and describe ...
Monika Polak
exaly +4 more sources