8 research outputs found
Union-intersecting set systems
Three intersection theorems are proved. First, we determine the size of the
largest set system, where the system of the pairwise unions is l-intersecting.
Then we investigate set systems where the union of any s sets intersect the
union of any t sets. The maximal size of such a set system is determined
exactly if s+t4. Finally, we exactly determine
the maximal size of a k-uniform set system that has the above described
(s,t)-union-intersecting property, for large enough n.Comment: 9 page
A note on vertex Tur\'an problems in the Kneser cube
The Kneser cube has vertex set and two vertices are
joined by an edge if and only if . For a fixed graph ,
we are interested in the most number of vertices of that span
a -free subgraph in . We show that the asymptotics of is
for bipartite and for graphs with chromatic
number at least 3. We also obtain results on the order of magnitude of
and in these two cases. In the case of
bipartite , we relate this problem to instances of the forbidden subposet
problem
Eötvös Collegium – Collegiumi ÉrtesÃtÅ‘ (2013/2014)
Az Eötvös Collegium évkönyvének IV. száma. A kiadvány a "Az Oktatási Hivatal által nyilvántartott szakkolégiumok támogatása" cÃmű pályázat keretében (NTP-SZKOLL-13-0030) valósult meg