Intersection Theorems for Systems of Sets
From MaRDI portal
Publication:3287337
DOI10.1112/jlms/s1-35.1.85zbMath0103.27901OpenAlexW2016341899WikidataQ105913842 ScholiaQ105913842MaRDI QIDQ3287337
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
Perfect measurable spaces, t-expansive and t-wise intersecting hypergraphs, Regular subgraphs of uniform hypergraphs, On partially ordered sets embeddable in a free lattice, On subsets of abelian groups with no 3-term arithmetic progression, On the representing number of intersecting families, The monotone circuit complexity of Boolean functions, The maximum number of edges in a 3-graph not containing a given star, Finite projective spaces and intersecting hypergraphs, Delta-system decompositions of graphs, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Suslin trees, the bounding number, and partition relations, On the VC-dimension of uniform hypergraphs, Top-down lower bounds for depth-three circuits, Decomposition of large combinatorial structures, Polynomial kernels for weighted problems, A Helly property of arcs, Turán problems and shadows. II: Trees, Exact solution of some Turán-type problems, Intersection statements for systems of sets, On the size of set systems on \([n\) not containing weak \((r,\Delta)\)-systems], On sunflowers and matrix multiplication, DNF sparsification and a faster deterministic counting algorithm, Difference sets and inverting the difference operator, Decompositions of partially ordered sets into chains and antichains of given size, On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\), An improved upper bound for the size of a sunflower-free family, A tale of stars and cliques, Connectifications of metrizable spaces, On decomposition of hypergraphs into \(\Delta\)-systems, Generalized split graphs and Ramsey numbers, ERCW PRAMs and optical communication, On the size of 3-uniform linear hypergraphs, The isomorphism conjecture for constant depth reductions, Equicovering subgraphs of graphs and hypergraphs, Embeddings in groups of permutations with supports of bounded cardinality, A finite set intersection theorem, Extremal problems and coverings of the space, Satisfiability, branch-width and Tseitin tautologies, Weak compactness in \(L^ 1(\)lambda) and injective Banach spaces, On large vector systems with equal scalar products, On the combinatorial problems which I would most like to see solved, Incomparability in parallel computation, Sur les espaces de Banach contenant \(l^ 1(\tau)\), How many \(F\)'s are there in \(G\)?, Balancing families of integer sequences, Generalization of Erdős-Gallai edge bound, On the readability of monotone Boolean formulae, Maximum hitting of a set by compressed intersecting families, Towards optimal and expressive kernelization for \(d\)-hitting set, Some structural properties of low-rank matrices related to computational complexity, Processor-time tradeoffs in PRAM simulations, On set systems not containing delta systems, Thresholds versus fractional expectation-thresholds, Unavoidable hypergraphs, Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits, Arithmetic progressions in subset sums, Unit interval vertex deletion: fewer vertices are relevant, Reconfiguration on sparse graphs, Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, M-embedded subspaces of certain product spaces, Bisection of trees and sequences, A general framework for discovering and proving theorems of the Erdős- Ko-Rado type, On Sidon sets which are asymptotic bases, Series-parallel chromatic hypergraphs, On sparse hard sets for counting classes, On finite \(\Delta\)-systems, Degrees and matchings, Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes, Equipartite colorings in graphs and hypergraphs, On finite Delta-systems. II, On Banach spaces which contain \(\ell^1(\tau)\) and types of measures on compact spaces, Note on sunflowers, Choosing between incompatible ideals, Separation with restricted families of sets, On dual \(L^1\)-spaces and injective bidual Banach spaces, Matchings and covers in hypergraphs, Improved bounds for the sunflower lemma, Reductions in circuit complexity: An isomorphism theorem and a gap theorem, Families of finite sets with three intersections, Decomposition of large uniform hypergraphs, Continuous mappings on subspaces of products with the \( \kappa \)-box topology, A polynomial kernel for diamond-free editing, On the maximum number of distinct intersections in an intersecting family, Homogeneous additive congruences, Graphs with restricted valency and matching number, The projection problem in commutative, positively ordered monoids, Present-biased optimization, Generalizing Galvin and Jónsson's classification to \(N_5\), Representing \((0,1)\)-matrices by Boolean circuits, On set systems without weak 3-\(\Delta\)-subsystems, Colored cut games, On finite set-systems whose every intersection is a kernel of a star, Extremal problems among subsets of a set, On disjointly representable sets, A combinatorial fact about free algebras, Stirling numbers and records, On a refinement of Waring's problem, Färbungen großer Würfel mit bunten Wegen, Set systems with three intersections, Defective coloring of hypergraphs, 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
