On Turan hypergraphs

Let α(H) be the stability number of a hypergraph H = (X, $\text{E}$). T(n, k, α) is the smallest q such that there exists a k-uniform hypergraph H with n vertices, q edges and with α(H) ? α. A k-uniform hypergraph H, with n vertices, T(n, k, α) edges and α(H) ?α is a Turan hypergraph. The value of T(n, 2, α) is given by a theorem of Turan. In this paper new lower bounds to T(n, k, α) are obtained and it is proved that an infinity of affine spaces are Turan hypergraphs.     

On unavoidable hypergraphs

A r-uniform hypergraph H (or a r-graph, for short) is a collection E = E(H) of r-element subsets (called edges) of a set V = V(H) (called vertices). We say a r-graph H is (n, e)-unavoidable if every r-graph with n vertices and e edges must contain H. In this paper we investigate the largest possible number of edges in an (n, e)-unavoidable 3-graph for fixed n and e. We also study the structure of such unavoidable 3-graphs.     

On 3-chromatic hypergraphs

Let $\text{F}$ be uniform hypergraph. In the present paper I prove that of $\text{|}\text{F}\text{| < n}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}{}^4\text{2}$ then the chromatic number of $\text{F}$ is equal to 2. I have a result in the general (not necessarily uniform) case too.     

On partitioning of hypergraphs

We study edge-isoperimetric problems (EIP) for hypergraphs and extend some technique in this area from graphs to hypergraphs. In particular, we establish some new results on a relationship between the EIP and some extremal poset problems, and apply them to obtain an exact solution of the EIP for certain hypergraph families. We also show how to solve the EIP on hypergraphs in some cases when the link to posets does not work. Another outcome of our results is a new series of hypergraphs admitting nested solutions in the EIP.     

On decompositions of complete hypergraphs

We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.     

On independent sets in hypergraphs

The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove that if H_n is an n‐vertex ‐uniform hypergraph in which every r‐element set is contained in at most d edges, where , then where satisfies as . The value of c_r improves and generalizes several earlier results that all use a theorem of Ajtai, Komlós, Pintz, Spencer and Szemerédi (J Comb Theory Ser A 32 (1982), 321–335). Our relatively short proof extends a method due to Shearer (Random Struct Algorithms 7 (1995), 269–271) and Alon (Random Struct Algorithms 9 (1996), 271–278). The above statement is close to best possible, in the sense that for each and all values of , there are infinitely many H_n such that where depends only on r. In addition, for many values of d we show as , so the result is almost sharp for large r. We give an application to hypergraph Ramsey numbers involving independent neighborhoods.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 224‐239, 2014     

On intersection multigraphs of hypergraphs

The sum of the cardinalities of all the edges of a hypergraph is computed in two different ways. This result is used to treat the generalisation of the notion of cyclomatic number for hypergraphs. Among others the following result is obtained: The cyclomatic number of the hypergraph H vanishes if and only if some maximum forest of the weighted intersection graph of H has the property that for every vertex of H the subgraph of the forest induced by those edges containing that vertex is connected.     

On hypergraphs without loose cycles

Recently, Mubayi and Wang showed that for $r\ge 4$ and $?\ge 3$, the number of $n$-vertex $r$-graphs that do not contain any loose cycle of length $?$ is at most $2^{O\left(n^{r?1}{(logn)}^{(r?3)∕(r?2)}\right)}$. We improve this bound to $2^{O(n^{r?1}loglogn)}$.     

On balanced colorings of hypergraphs

This paper deals with an extremal problem concerning hypergraph colorings. Let k be an integer. The problem is to find the value m _k (n) equal to the minimum number of edges in an n-uniform hypergraph not admitting two-colorings of the vertex set such that every edge of the hypergraph contains k vertices of each color. In this paper, we obtain the exact values of m ₂(5) and m ₂(4), and the upper bounds for m ₃(7) and m ₄(9).     

On hypergraphs without significant cycles

A property of the intersection multigraph of a hypergraph is displayed. This property is then used to obtain an equality connecting the order of the hypergraph, the sizes of its edges and the number of edges of its intersection multigraph. At the end a generalization by Las Vergnas of a result of Lovász is given another proof.     

On the VC-dimension of uniform hypergraphs

Let be a k-uniform hypergraph on [n] where k−1 is a power of some prime p and n≥ n ₀(k). Our main result says that if , then there exists E ₀∊ such that {E∩ E ₀: E∊ } contains all subsets of E ₀. This improves a longstanding bound of due to Frankl and Pach [7].Research supported in part by NSF grants DMS-0400812 and an Alfred P. Sloan Research Fellowship.Research supported in part by NSA grant H98230-05-1-0079. Part of this research was done while working at University of Illinois at Chicago.     

On the divisibility of homogeneous hypergraphs

We denote byK _k ,k, 2, the set of allk-uniform hypergraphsK which have the property that every element subset of the base ofK is a subset of one of the hyperedges ofK. So, the only element inK ₂ ² are the complete graphs. If is a subset ofK _k then there is exactly one homogeneous hypergraphH whose age is the set of all finite hypergraphs which do not embed any element of . We callH -free homogeneous graphsH _n have been shown to be indivisible, that is, for any partition ofH _n into two classes, oue of the classes embeds an isomorphic copy ofH _n . [5]. Here we will investigate this question of indivisibility in the more general context of-free homogeneous hypergraphs. We will derive a general necessary condition for a homogeneous structure to be indivisible and prove that all-free hypergraphs for K _k with 3 are indivisible. The-free hypergraphs with K _k ² satisfy a weaker form of indivisibility which was first shown by Henson [2] to hold forH _n . The general necessary condition for homogeneous structures to be indivisible will then be used to show that not all-free homogeneous hypergraphs are indivisible.This research has been supported by NSERC grant 69–1325.     

On extremal hypergraphs for Hamiltonian cycles

We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turán- and Dirac-type results. While the Turán-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree.