The following pages link to Lawrence H. Harper (Q783064):
Displaying 26 items.
- The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner (Q783067) (← links)
- Some remarks on normalized matching (Q787981) (← links)
- (Q955024) (redirect page) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- On a continuous analog of Sperner's problem (Q1073035) (← links)
- A Sperner theorem for the interval order of a projective geometry (Q1149457) (← links)
- The global theory of flows in networks (Q1157274) (← links)
- Linear programming the global approach (Q1166413) (← links)
- The global theory of paths in networks. I: Definitions, examples and limits (Q1167670) (← links)
- On a problem of Kleitman and West (Q1182891) (← links)
- The morphology of partially ordered sets (Q1213863) (← links)
- A class of Boolean functions with linear combinational complexity (Q1223937) (← links)
- On an isoperimetric problem for Hamming graphs (Q1302164) (← links)
- Duality theorems for a continuous analog of Ford-Fulkerson flows in networks (Q1325747) (← links)
- The edge-isoperimetric problem on the 600-vertex regular solid (Q1399246) (← links)
- On the bandwidth of a Hamming graph (Q1400004) (← links)
- Morphisms for the maximum weight ideal problem (Q1584660) (← links)
- Size of the largest antichain in a partition poset (Q1812372) (← links)
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (Q1814142) (← links)
- Accidental combinatorist, an autobiography (Q1885042) (← links)
- The congestion of \(n\)-cube layout on a rectangular grid (Q1970694) (← links)
- Morphisms for resistive electrical networks (Q2434733) (← links)
- On the complexity of the marriage problem (Q2556860) (← links)
- The symmetric group, ordered by refinement of cycles, is strongly Sperner (Q4990332) (← links)
- A Family of Combinatorial Identities (Q5514943) (← links)
- Stirling Behavior is Asymptotically Normal (Q5535491) (← links)
