Intersection Theorems for Systems of Sets
From MaRDI portal
Recommendations
- An intersection theorem for systems of sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets (II)
- An intersection theorem for systems of finite sets
- Intersection statements for systems of sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of sets (III)
- The complete intersection theorem for systems of finite sets
- Intersection Properties of Systems of Finite Sets
- scientific article; zbMATH DE number 3596845
Cited in
(only showing first 100 items - show all)- Continuous mappings on subspaces of products with the \( \kappa \)-box topology
- Graphs with restricted valency and matching number
- Representing \((0,1)\)-matrices by Boolean circuits
- Stirling numbers and records
- Set systems with three intersections
- Perfect measurable spaces
- t-expansive and t-wise intersecting hypergraphs
- On partially ordered sets embeddable in a free lattice
- An infinite version of Ryser's inequality
- 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
- Decomposition of large combinatorial structures
- A Helly property of arcs
- Exact solution of some Turán-type problems
- Decompositions of partially ordered sets into chains and antichains of given size
- On decomposition of hypergraphs into -systems
- ERCW PRAMs and optical communication
- Embeddings in groups of permutations with supports of bounded cardinality
- A finite set intersection theorem
- Extremal problems and coverings of the space
- 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
- Sur les espaces de Banach contenant \(l^ 1(\tau)\)
- Balancing families of integer sequences
- Processor-time tradeoffs in PRAM simulations
- On set systems not containing delta systems
- Arithmetic progressions in subset sums
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type
- 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
- On dual L^1-spaces and injective bidual Banach spaces
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- Delta-system decompositions of graphs
- Intersection statements for systems of sets
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- Connectifications of metrizable spaces
- Generalized split graphs and Ramsey numbers
- Suslin trees, the bounding number, and partition relations
- An improved upper bound for the size of a sunflower-free family
- A tale of stars and cliques
- Unit interval vertex deletion: fewer vertices are relevant
- Matchings and covers in hypergraphs
- On set systems without weak 3-\(\Delta\)-subsystems
- Extremal problems among subsets of a set
- Remark on a theorem of Lindström
- On a refinement of Waring's problem
- Top-down lower bounds for depth-three circuits
- Difference sets and inverting the difference operator
- The complete nontrivial-intersection theorem for systems of finite sets
- Some structural properties of low-rank matrices related to computational complexity
- Thresholds versus fractional expectation-thresholds
- Unavoidable hypergraphs
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Set systems with positive intersection sizes
- Note on sunflowers
- Choosing between incompatible ideals
- Improved bounds for the sunflower lemma
- A polynomial kernel for diamond-free editing
- On the maximum number of distinct intersections in an intersecting family
- Homogeneous additive congruences
- The projection problem in commutative, positively ordered monoids
- Present-biased optimization
- Colored cut games
- Dynamic kernels for hitting sets and set packing
- Turán numbers for hypergraph star forests
- Pseudo sunflowers
- An introduction to the computational complexity of matrix multiplication
- On the size of shadow-added intersecting families
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
- Intersecting systems of signed sets
- The cell probe complexity of succinct data structures
- Systems of nonempty intersection theorems with applications
- Inverting the Turán problem
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Forbidding complete hypergraphs as traces
- Extremal problems among subsets of a set. (Reprint)
- Expandable network and covering properties for uniform Eberlein compacta
- On a problem of Erdős, Hajnal and Rado
- Intersection theorems for systems of sets
- Hilbert cubes in arithmetic sets
- Kernel for \(K_t\)\textsc-free Edge Deletion
- Generalized Sidon sets of perfect powers
- The complexity of binary matrix completion under diameter constraints
- On the parameterized complexity of clustering problems for incomplete data
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Bounds on half graph orders in powers of sparse graphs
- Regular subgraphs of uniform hypergraphs
- Unavoidable connected matroids retaining a specified minor
- Kernelization -- preprocessing with a guarantee
This page was built for publication: Intersection Theorems for Systems of Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3287337)
