The following pages link to Shlomo Hoory (Q557835):
Displaying 15 items.
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
- A lower bound on the spectral radius of the universal cover of a graph (Q707021) (← links)
- Maximum matchings in regular graphs of high girth (Q870087) (← links)
- The Moore bound for irregular graphs (Q1348665) (← links)
- The size of bipartite graphs with a given girth (Q1403918) (← links)
- On codes from hypergraphs. (Q1427432) (← links)
- Universal traversal sequences for expander graphs (Q1802060) (← links)
- A continuous analogue of the girth problem (Q1850595) (← links)
- Central points for sets in \(\mathbb{R}^ n\) (or: the chocolate ice-cream problem) (Q1913696) (← links)
- A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex (Q2573652) (← links)
- Simple permutations mix well (Q2581269) (← links)
- (Q3002766) (← links)
- On the girth of random Cayley graphs (Q3055767) (← links)
- A Note on Unsatisfiable <i>k</i>-CNF Formulas with Few Occurrences per Variable (Q3440269) (← links)
