Independent sets in algebraic hypergraphs
نویسندگان
چکیده
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, the spirit of so-called transference principles extremal combinatorics, that if a given algebraic hypergraph “dense” certain sense, then generic low-dimensional subset its vertices induces subhypergraph also “dense.” (For technical reasons, only consider subsets are parameterized by rational functions.) proof approach inspired containers method, developed Balogh, Morris, and Samotij independently Saxton Thomason (although adapting method setting presents some unique challenges do not occur when working with finite hypergraphs). Along way, establish natural generalization classical dimension fibers theorem geometry, which interesting own right.
منابع مشابه
Independent Sets in Hypergraphs
Many important theorems and conjectures in combinatorics, such as the theorem of Szemerédi on arithmetic progressions and the Erdős-Stone Theorem in extremal graph theory, can be phrased as statements about families of independent sets in certain uniform hypergraphs. In recent years, an important trend in the area has been to extend such classical results to the so-called ‘sparse random setting...
متن کاملOn independent sets in hypergraphs
The independence number α(H) 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 Hn is an n-vertex (r+ 1)-uniform hypergraph in which every r-element set is contained in at most d edges, where 0 < d < n/(logn) 2 , then α(Hn) ≥ cr (n d log n d )1/r where cr > 0 satisfies cr ∼ r/e as r → ∞. The value of cr improves and generalizes se...
متن کاملCounting Independent Sets in Hypergraphs
Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least e(1−n −1/12) 1 2 n t ln t( 1 2 ln t−1) independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n → ∞, every triangle-free graph on n vertices has at least e(c1−o(1)) √ n lnn independent sets, where c1 = √ ln 2/4 = 0.208138... Further...
متن کاملIndependent Sets in Bounded-Degree Hypergraphs
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certa...
متن کاملApproximating Maximum Independent Sets in Uniform Hypergraphs
We consider the problem of approximating the independence number and the chromatic number of k-uniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log 1) n)2). This extends results of Boppana and Halld orsson [5] who showed for the graph case that an approximation ratio of O(n=(logn)) c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the European Mathematical Society
سال: 2021
ISSN: ['1435-9855', '1435-9863']
DOI: https://doi.org/10.4171/jems/1082