The following pages link to (Q4552141):
Displaying 37 items.
- On the covering number of small symmetric groups and some sporadic simple groups. (Q338837) (← links)
- Dominating circuits in regular matroids (Q395251) (← links)
- An Erdős-Gallai theorem for matroids (Q434226) (← links)
- Number theoretic correlation inequalities for Dirichlet densities (Q677622) (← links)
- All binomial identities are orderable (Q730270) (← links)
- Avoiding brooms, forks, and butterflies in the linear lattices (Q781522) (← links)
- On the maximum number of translates in a point set (Q848857) (← links)
- The generalized Füredi conjecture holds for finite linear lattices (Q856864) (← links)
- On Bernoulli decompositions for random variables, concentration bounds, and spectral localization (Q957727) (← links)
- The necklace poset is a symmetric chain order (Q986102) (← links)
- Methods for nesting rank 3 normalized matching rank-unimodal posets (Q1011490) (← links)
- On Whitney numbers of the order ideals of generalized fences and crowns (Q1011689) (← links)
- Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets (Q1025456) (← links)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- The normalized matching property in random and pseudorandom bipartite graphs (Q2034078) (← links)
- Projection inequalities for antichains (Q2200031) (← links)
- Some remarks on nestings in the normalized matching posets of rank 3 (Q2279681) (← links)
- A continuous analogue of Erdős' \(k\)-Sperner theorem (Q2287347) (← links)
- A Kruskal-Katona type result and applications (Q2305915) (← links)
- Semi-distance codes and Steiner systems (Q2373934) (← links)
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices (Q2397710) (← links)
- Minimum weight flat antichains of subsets (Q2665830) (← links)
- The EGH Conjecture and the Sperner property of complete intersections (Q2957794) (← links)
- Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems (Q3225498) (← links)
- Partial covering arrays and a generalized Erdös-Ko-Rado property (Q3576974) (← links)
- ABELIAN PRIMITIVE WORDS (Q4902891) (← links)
- Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (Q5034136) (← links)
- A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields (Q5047974) (← links)
- (Q5111018) (← links)
- Nonhomogeneous analytic families of trees (Q5227975) (← links)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)
- Two characterizations of the dense rank (Q6121904) (← links)
- The saturation spectrum for antichains of subsets (Q6139859) (← links)
- Formalising the Kruskal-Katona theorem in Lean (Q6159369) (← links)
- Extremal problems concerning ordered intersections of sets (Q6547221) (← links)
- Intersecting families of polynomials over finite fields (Q6655759) (← links)
