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)
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
This page was built for publication: Intersection Theorems for Systems of Sets
