The following pages link to (Q3741626):
Displaying 50 items.
- A Meshalkin theorem for projective geometries (Q1395829) (← links)
- An upper bound on the sum of squares of degrees in a hypergraph (Q1402082) (← links)
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups (Q1403877) (← links)
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups (Q1403878) (← links)
- On \(k\)-hypertournament matrices (Q1414139) (← links)
- Yet another generalization of the Kruskal-Katona theorem (Q1584224) (← links)
- Enumeration of certain finite semigroups of transformations (Q1584362) (← links)
- Voting fairly: Transitive maximal intersecting families of sets (Q1584664) (← links)
- Partitioning the Boolean lattice into chains of large minimum size (Q1604571) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Forbidden induced subposets of given height (Q1621436) (← links)
- Lattice-based refinement in bounded model checking (Q1629959) (← links)
- Supersaturation in posets and applications involving the container method (Q1679331) (← links)
- Nested chain partitions of LYM posets (Q1765530) (← links)
- The homotopy classes of continuous maps between some nonmetrizable manifolds (Q1767717) (← links)
- Essential covers of the cube by hyperplanes (Q1770439) (← links)
- Shifting operations and graded Betti numbers (Q1840655) (← links)
- A note on a lemma of Brauer (Q1842159) (← links)
- The numbers of dependent \(k\)-sets in a graph are log concave (Q1850583) (← links)
- Families implying the Frankl conjecture (Q1864599) (← links)
- The width of random subsets of Boolean lattices (Q1865401) (← links)
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size (Q1867287) (← links)
- Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
- Towards characterizing equality in correlation inequalities (Q1896333) (← links)
- A coding theoretic approach to extending designs (Q1896352) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- Matchings, cutsets, and chain partitions in graded posets (Q1898341) (← links)
- The normalized matching property from the generalized Macaulay theorem (Q1904384) (← links)
- The poset on connected induced subgraphs of a graph need not be Sperner (Q1904390) (← links)
- Maximum trees of finite sequences (Q1904988) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Several families with incomparability and complementarity conditions (Q2026327) (← links)
- Kruskal-Katona function and variants of cross-intersecting antichains (Q2065885) (← links)
- Forbidden subposet problems in the grid (Q2065899) (← links)
- Edge isoperimetric inequalities for powers of the hypercube (Q2121790) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- New bounds on the maximum size of Sperner partition systems (Q2225393) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- An Erdős-Ko-Rado theorem for restricted signed sets (Q2267280) (← links)
- Power indices and minimal winning coalitions (Q2268380) (← links)
- Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
- Most probably intersecting hypergraphs (Q2341073) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- A class of posets with integral Laplacian spectrum (Q2361562) (← links)
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets (Q2369012) (← links)
- The poset on connected graphs is Sperner (Q2397104) (← links)
- Characterising nested database dependencies by fragments of propositional logic (Q2478548) (← links)
- Embeddings and other mappings of rooted trees into complete trees (Q2492805) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
