The following pages link to Daniel J. Kleitman (Q228778):
Displayed 50 items.
- Some new results on the Littlewood-Offord problem (Q1237733) (← links)
- Further results on the Aanderaa-Rosenberg conjecture (Q1237992) (← links)
- Strong versions of Sperner's theorem (Q1239323) (← links)
- Matrix tree theorems (Q1245845) (← links)
- Skew chain orders and sets of rectangles (Q1258741) (← links)
- The mathematical work of Bernt Lindström (Q1260766) (← links)
- Minimally distant sets of lattice points (Q1260773) (← links)
- A minimal cutset of the Boolean lattice with almost all members (Q1262863) (← links)
- Minimum cutsets for an element of a Boolean lattice (Q1264164) (← links)
- Independence and the Havel-Hakimi residue (Q1322229) (← links)
- An upper bound for the Ramsey numbers \(r(K_ 3,G)\) (Q1322269) (← links)
- Crossing families (Q1330788) (← links)
- The prison yard problem (Q1340137) (← links)
- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture (Q1378536) (← links)
- On the design of reliable Boolean circuits that contain partially unreliable gates (Q1384528) (← links)
- Finding convex sets among points in the plane (Q1387852) (← links)
- On a problem in shuffling (Q1584647) (← links)
- A note on caterpillar-embeddings with no two parallel edges (Q1772131) (← links)
- Representations of families of triples over \(GF(2)\) (Q1812889) (← links)
- Sphere coverings of the hypercube with incomparable centers (Q1813996) (← links)
- Inequalities for the number of monotonic functions of partial orders (Q1820178) (← links)
- A generalized model for understanding evasiveness (Q1825645) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- An algorithm for collapsing sign alternating sequences of real numbers (Q1838785) (← links)
- Extremal problems among subsets of a set (Q1843567) (← links)
- On the number of latent subsets of intersecting collections (Q1843569) (← links)
- On partitions of discrete boxes (Q1850011) (← links)
- Forcing disjoint segments in the plane (Q1916059) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← links)
- On a lemma of Littlewood and Offord on the distribution of certain sums (Q2524685) (← links)
- On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors (Q2539291) (← links)
- Maximal sized antichains in partial orders (Q2546211) (← links)
- Some positive definite functions on sets and their application to the Ising model (Q2547213) (← links)
- A generalization of Kaplansky's game (Q2551745) (← links)
- Increasing paths in edge ordered graphs (Q2554343) (← links)
- How many sums of vectors can lie in a circle of diameter \(\sqrt 2?\) (Q2555501) (← links)
- On the average size of the sets in a Sperner family (Q2562857) (← links)
- Families of \(k\)-independent sets (Q2563162) (← links)
- Acyclic matchings (Q2564359) (← links)
- On the number of databases and closure operations (Q2638763) (← links)
- An Almost Linear Time Algorithm for Generalized Matrix Searching (Q3031930) (← links)
- Spanning trees with many leaves in cubic graphs (Q3035303) (← links)
- Probabilities of Independent Choices Being Ordered (Q3050439) (← links)
- (Q3138290) (← links)
- (Q3201067) (← links)
- A Note on Random Triangles (Q3206021) (← links)
- On a dual version of the one-dimensional bin packing problem (Q3219761) (← links)
- Some results on analytic functions in local field theory (Q3260381) (← links)
- On the parity of K-baryon vertices (Q3262701) (← links)
- Traditional Galleries Require Fewer Watchmen (Q3315525) (← links)