34,575 research outputs found
Algorithmic aspects of covering supermodular functions under matroid constraints
A common generalization of earlier results on arborescence packing and the covering of intersecting bi-set families was presented by the authors in [Bérczi, Király, Kobayashi, 2013]. The present paper investigates the algorithmic aspects of that result and gives a polynomial-time algorithm for the corresponding optimization problem
Game saturation of intersecting families
We consider the following combinatorial game: two players, Fast and Slow,
claim -element subsets of alternately, one at each turn,
such that both players are allowed to pick sets that intersect all previously
claimed subsets. The game ends when there does not exist any unclaimed
-subset that meets all already claimed sets. The score of the game is the
number of sets claimed by the two players, the aim of Fast is to keep the score
as low as possible, while the aim of Slow is to postpone the game's end as long
as possible. The game saturation number is the score of the game when both
players play according to an optimal strategy. To be precise we have to
distinguish two cases depending on which player takes the first move. Let
and denote the score of
the saturation game when both players play according to an optimal strategy and
the game starts with Fast's or Slow's move, respectively. We prove that
holds
Some New Bounds For Cover-Free Families Through Biclique Cover
An cover-free family is a family of subsets of a finite set
such that the intersection of any members of the family contains at least
elements that are not in the union of any other members. The minimum
number of elements for which there exists an with blocks is
denoted by .
In this paper, we show that the value of is equal to the
-biclique covering number of the bipartite graph whose vertices
are all - and -subsets of a -element set, where a -subset is
adjacent to an -subset if their intersection is empty. Next, we introduce
some new bounds for . For instance, we show that for
and
where is a constant satisfies the
well-known bound . Also, we
determine the exact value of for some values of . Finally, we
show that whenever there exists a Hadamard matrix of
order 4d
On the number of maximal intersecting k-uniform families and further applications of Tuza's set pair method
We study the function which denotes the number of maximal
-uniform intersecting families . Improving a
bound of Balogh at al. on , we determine the order of magnitude of
by proving that for any fixed , holds. Our proof is based on Tuza's set pair
approach.
The main idea is to bound the size of the largest possible point set of a
cross-intersecting system. We also introduce and investigate some related
functions and parameters.Comment: 11 page
- …