Intersection Theorems for Systems of Sets
From MaRDI portal
Publication:3287337
DOI10.1112/JLMS/S1-35.1.85zbMath0103.27901OpenAlexW2016341899WikidataQ105913842 ScholiaQ105913842MaRDI QIDQ3287337
No author found.
Publication date: 1960
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-35.1.85
Extremal set theory (05D05) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items (only showing first 100 items - show all)
Turán numbers for hypergraph star forests ⋮ UPPER BOUNDS FOR SUNFLOWER-FREE SETS ⋮ The analytic rank of tensors and its applications ⋮ Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Concentration of non‐Lipschitz functions and applications ⋮ The cell probe complexity of succinct data structures ⋮ Sunflowers: from soil to oil ⋮ Pseudo sunflowers ⋮ Hilbert cubes in arithmetic sets ⋮ Kernelization – Preprocessing with a Guarantee ⋮ On Sidon sets and asymptotic bases ⋮ Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs ⋮ Turán numbers of sunflowers ⋮ Maximal triangle‐free graphs with restrictions on the degrees ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ Multicolour Sunflowers ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On finite δ-systems of Erdős and Rado ⋮ Kernel for \(K_t\)\textsc{-free Edge Deletion} ⋮ On the Readability of Monotone Boolean Formulae ⋮ Unnamed Item ⋮ An introduction to the computational complexity of matrix multiplication ⋮ Computing Hitting Set Kernels By AC^0-Circuits ⋮ Sunflowers and testing triangle-freeness of functions ⋮ A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time ⋮ Generalized Sidon sets of perfect powers ⋮ THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ The complexity of binary matrix completion under diameter constraints ⋮ Near-sunflowers and focal families ⋮ Rainbow independent sets in certain classes of graphs ⋮ Unnamed Item ⋮ Inverting the Turán problem ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ Essentially tight kernels for (weakly) closed graphs ⋮ Almost optimal query algorithm for hitting set using a subset query ⋮ On restricted intersections and the sunflower problem ⋮ Packing arc-disjoint cycles in oriented graphs ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP ⋮ On the parameterized complexity of clustering problems for incomplete data ⋮ On Active and Passive Testing ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Multicut Is FPT ⋮ Unnamed Item ⋮ Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues ⋮ Bounds on half graph orders in powers of sparse graphs ⋮ Factoring Functions on Cartesian Products ⋮ Integer Representation and Counting in the Bit Probe Model ⋮ On the size of shadow-added intersecting families ⋮ Some remarks on the lonely runner conjecture ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ A Polynomial Kernel for Line Graph Deletion ⋮ A Polynomial Kernel for Diamond-Free Editing ⋮ Intersection theorems for systems of sets (III) ⋮ Diversity ⋮ Sunflowers and -intersecting families ⋮ Hypergraphs with pendant paths are not chromatically unique ⋮ Paul Erdős, 1913-1996 ⋮ How to have more things by forgetting how to count them ⋮ Forbidding complete hypergraphs as traces ⋮ On the concentration of multivariate polynomials with small expectation ⋮ Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes ⋮ On intersecting families of finite sets ⋮ Constructive lower bounds for off-diagonal Ramsey numbers ⋮ A consistency result concerning hereditarily α-Lindelöf spaces ⋮ The Chromatic Number of Kneser Hypergraphs ⋮ Extremal problems among subsets of a set. (Reprint) ⋮ The category of unary algebras, containing a given subalgebra I ⋮ Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes ⋮ Chain conditions and the existence of delta-families ⋮ Expandable network and covering properties for uniform Eberlein compacta ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Answer to a Question by Burr and Erdős on Restricted Addition, and Related Results ⋮ On families of finite sets no two of which intersect in a singleton ⋮ Coding for Sunflowers ⋮ Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems ⋮ Combinatorial Set Theory and Cardinal Function Inequalities ⋮ Scattered Classes of Graphs ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Multiple Domination ⋮ Unavoidable Connected Matroids Retaining a Specified Minor ⋮ Unnamed Item ⋮ Zero-One Laws for Sparse Random Graphs ⋮ An Upper Bound for Weak $B_k$-Sets ⋮ On approximate preprocessing for domination and hitting subgraphs with connected deletion sets ⋮ On a problem of Erdős, Hajnal and Rado ⋮ Intersection theorems for systems of sets ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs ⋮ Lossy Kernels for Hitting Subgraphs ⋮ Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ Families of finite sets with prescribed cardinalities for pairwise intersections ⋮ Dynamic kernels for hitting sets and set packing ⋮ Unnamed Item ⋮ Monotone circuit lower bounds from robust sunflowers ⋮ The densest matroids in minor-closed classes with exponential growth rate ⋮ Defective coloring of hypergraphs
This page was built for publication: Intersection Theorems for Systems of Sets
