The following pages link to (Q4083487):
Displayed 12 items.
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- Odd and even Hamming spheres also have minimum boundary (Q798656) (← links)
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality (Q858978) (← links)
- A short proof for a theorem of Harper about Hamming-spheres (Q1162510) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem (Q1261160) (← links)
- On the convexified Sauer-Shelah theorem (Q1354724) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
- Every monotone graph property has a sharp threshold (Q4717065) (← links)
- Arbitrary Threshold Widths for Monotone, Symmetric Properties (Q5443708) (← links)
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes (Q5936463) (← links)