منابع مشابه
Extremal Problems for Subset Divisors
Let A be a set of n positive integers. We say that a subset B of A is a divisor of A, if the sum of the elements in B divides the sum of the elements in A. We are interested in the following extremal problem. For each n, what is the maximum number of divisors a set of n positive integers can have? We determine this function exactly for all values of n. Moreover, for each n we characterize all s...
متن کاملExtremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric
A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...
متن کاملEXTREMAL EFFECTIVE DIVISORS ON M1,n
For every n ≥ 3, we exhibit infinitely many extremal effective divisors on M1,n, the Deligne-Mumford moduli space parameterizing stable genus one curves with n ordered marked points.
متن کاملExtremal Problems for Roman Domination
A Roman dominating function of a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ v∈V (G) f(v) over such functions. Let G be a connected n-vertex graph. We prove that γR(G) ≤ 4n/5, and we characterize the graphs achieving equality. We obtain sharp upper and lower bounds for γR(...
متن کاملSpectral Extremal Problems for Hypergraphs
In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria under which such results may be deduced from ‘strong stability’ forms of the corresponding (pure) extremal results. These results hold for the α-spectral radius defined using the α-norm for any α > 1; the usual spectral radius is the case α = 2. Our results imply that any hypergraph Turán problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3438