Results 1 to 10 of about 24,841 (222)
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
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. It applies this approach for the derivation of information inequalities with Shannon information measures.
Sason I.
europepmc +5 more sources
An extremal problem in graph theory II [PDF]
Journal of the Australian Mathematical Society, 1980 AbstractWe contine our study of the following combinatorial problem: What is the largest integer N = N (t, m, p) for which there exists a set of N people satisfying the following conditions: (a) each person speaks t languages, (b) among any m people there are two who speak a common language and (c) at most p speak a common language.
Abbott, H. L. +2 more
openaire +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
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
An extremal problem in graph theory [PDF]
Journal of the Australian Mathematical Society, 1970 G(n;l) will denote a graph of n vertices and l edges. Let f0(n, k) be the smallest integer such that there is a G (n;f0(n, k)) in which for every set of k vertices there is a vertex joined to each of these. Thus for example fo = 3 since in a triangle each pair of vertices is joined to a third.
Erdős, Pál, Moser, L.
openaire +1 more source
Finitely forcible graph limits are universal [PDF]
, 2018 The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly within ...
Cooper, Jacob W. +2 more
core +3 more sources
Graph-Theoretic Approach for Self-Testing in Bell Scenarios
PRX Quantum, 2022 Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set B_{Q} of quantum correlations for a Bell experiment are achieved, up to isometries ...
Kishor Bharti +5 more
doaj +1 more source
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 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