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 the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- Homogeneous additive congruences (Q2080677) (← links)
- The projection problem in commutative, positively ordered monoids (Q2082735) (← links)
- Present-biased optimization (Q2082782) (← links)
- Colored cut games (Q2087453) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Pseudo sunflowers (Q2143417) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Intersecting systems of signed sets (Q2372885) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Systems of nonempty intersection theorems with applications (Q2378827) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- Inverting the Turán problem (Q2421851) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues (Q2435506) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← links)
- Expandable network and covering properties for uniform Eberlein compacta (Q2502941) (← links)
- On a problem of Erdős, Hajnal and Rado (Q2553436) (← links)
- Intersection theorems for systems of sets (Q2555852) (← links)
- Hilbert cubes in arithmetic sets (Q2633994) (← links)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- Generalized Sidon sets of perfect powers (Q2675249) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Unavoidable connected matroids retaining a specified minor (Q2818205) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
- The category of unary algebras, containing a given subalgebra I (Q3050479) (← links)
- Some remarks on the lonely runner conjecture (Q3120645) (← links)
- Combinatorial Set Theory and Cardinal Function Inequalities (Q3198501) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- Multiple Domination (Q3384609) (← links)
- On Sidon sets and asymptotic bases (Q3458238) (← links)
- Some Results on Chromaticity of Quasilinear Hypergraphs (Q3462328) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- Zero-One Laws for Sparse Random Graphs (Q3791190) (← links)
- Families of finite sets with prescribed cardinalities for pairwise intersections (Q3931437) (← links)
- Intersection theorems for systems of sets (III) (Q4097290) (← links)
- Chain conditions and the existence of delta-families (Q4149457) (← links)
- (Q4163209) (← links)
- On families of finite sets no two of which intersect in a singleton (Q4165389) (← links)
- Maximal triangle‐free graphs with restrictions on the degrees (Q4277984) (← links)
- A consistency result concerning hereditarily α-Lindelöf spaces (Q4401935) (← links)
