The following pages link to Nathan Linial (Q178480):
Displaying 50 items.
- (Q312135) (redirect page) (← links)
- Invariants of random knots and links (Q312136) (← links)
- On the phase transition in random simplicial complexes (Q338421) (← links)
- On high-dimensional acyclic tournaments (Q393743) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Strong convergence in posets (Q423649) (← links)
- An upper bound on the number of high-dimensional permutations (Q485003) (← links)
- A note on the inducibility of 4-vertex graphs (Q497330) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
- The expected genus of a random chord diagram (Q629824) (← links)
- On the Lipschitz constant of the RSK correspondence (Q645961) (← links)
- The influence of large coalitions (Q684398) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Random graph coverings. I: General theory and graph connectivity (Q700369) (← links)
- Metric embeddings -- beyond one-dimensional distortion (Q701786) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- (Q788738) (redirect page) (← links)
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- Graph decompositions without isolates (Q790844) (← links)
- The non-crossing graph (Q813926) (← links)
- Homological connectivity of random 2-complexes (Q858146) (← links)
- Lifts, discrepancy and nearly optimal spectral gap (Q879159) (← links)
- Some extremal problems arising from discrete control processes (Q913685) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Every poset has a central element (Q1068859) (← links)
- Graph coloring and monotone functions on posets (Q1069950) (← links)
- Deciding hypergraph 2-colourability by H-resolution (Q1069951) (← links)
- Largest induced suborders satisfying the chain condition (Q1074604) (← links)
- Legal coloring of graphs (Q1079578) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- Cycles of length 0 modulo k in directed graphs (Q1093650) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- Extremal problems on permutations under cyclic equivalence (Q1109772) (← links)
- Interpolation between bases and the shuffle exchange network (Q1114665) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- The linear-array conjecture in communication complexity is false (Q1125618) (← links)
- On Petersen's graph theorem (Q1148334) (← links)
- Extending the Greene-Kleitman theorem to directed graphs (Q1155625) (← links)
- A new derivation of the counting formula for Young tableaux (Q1167169) (← links)
- Approximate inclusion-exclusion (Q1174115) (← links)
- Additive bases of vector spaces over prime fields (Q1175950) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Balancing extensions via Brunn-Minkowski (Q1181013) (← links)
- The equivalence of two problems on the cube (Q1194759) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- On convex body chasing (Q1207798) (← links)
- A lower bound for the circumference of a graph (Q1232423) (← links)
- Covering digraphs by paths (Q1250116) (← links)
- Low distortion Euclidean embeddings of trees (Q1269777) (← links)
