Pages that link to "Item:Q3287337"
From MaRDI portal
The following pages link to Intersection Theorems for Systems of Sets (Q3287337):
Displaying 50 items.
- On decomposition of hypergraphs into \(\Delta\)-systems (Q1123903) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- Embeddings in groups of permutations with supports of bounded cardinality (Q1144122) (← links)
- A finite set intersection theorem (Q1152365) (← links)
- Extremal problems and coverings of the space (Q1153096) (← links)
- Weak compactness in \(L^ 1(\)lambda) and injective Banach spaces (Q1155226) (← links)
- On large vector systems with equal scalar products (Q1161575) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Sur les espaces de Banach contenant \(l^ 1(\tau)\) (Q1166063) (← links)
- Balancing families of integer sequences (Q1167206) (← links)
- Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
- On set systems not containing delta systems (Q1187943) (← links)
- Arithmetic progressions in subset sums (Q1193447) (← links)
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type (Q1200000) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On finite \(\Delta\)-systems (Q1211046) (← links)
- Degrees and matchings (Q1224590) (← links)
- Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes (Q1225057) (← links)
- Equipartite colorings in graphs and hypergraphs (Q1236124) (← links)
- On finite Delta-systems. II (Q1236531) (← links)
- On Banach spaces which contain \(\ell^1(\tau)\) and types of measures on compact spaces (Q1241686) (← links)
- On dual \(L^1\)-spaces and injective bidual Banach spaces (Q1258066) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Delta-system decompositions of graphs (Q1356709) (← links)
- Intersection statements for systems of sets (Q1369684) (← links)
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems (Q1369741) (← links)
- Connectifications of metrizable spaces (Q1379788) (← links)
- Generalized split graphs and Ramsey numbers (Q1380352) (← links)
- Suslin trees, the bounding number, and partition relations (Q1650460) (← links)
- An improved upper bound for the size of a sunflower-free family (Q1669672) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On set systems without weak 3-\(\Delta\)-subsystems (Q1842144) (← links)
- Extremal problems among subsets of a set (Q1843567) (← links)
- Remark on a theorem of Lindström (Q1844836) (← links)
- On a refinement of Waring's problem (Q1847774) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- Difference sets and inverting the difference operator (Q1912753) (← links)
- The complete nontrivial-intersection theorem for systems of finite sets (Q1924241) (← links)
- Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
- Thresholds versus fractional expectation-thresholds (Q1983096) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Set systems with positive intersection sizes (Q2012516) (← links)
- Note on sunflowers (Q2032700) (← links)
- Choosing between incompatible ideals (Q2033891) (← links)
- Improved bounds for the sunflower lemma (Q2058613) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
