The following pages link to Benjamin Sudakov (Q1584432):
Displayed 50 items.
- The \(n\)-queens completion problem (Q2157925) (← links)
- Ramsey number of 1-subdivisions of transitive tournaments (Q2171017) (← links)
- Long directed rainbow cycles and rainbow spanning trees (Q2189824) (← links)
- The oriented size Ramsey number of directed paths (Q2189825) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- An extremal problem for integer sparse recovery (Q2282769) (← links)
- Submodular minimization under congruency constraints (Q2300162) (← links)
- Multicolour bipartite Ramsey number of paths (Q2325761) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Most probably intersecting hypergraphs (Q2341073) (← links)
- Swarming on random graphs. II (Q2342074) (← links)
- The Turán number of the Fano plane (Q2368588) (← links)
- On a hypergraph Turán problem of Frankl (Q2368596) (← links)
- Paths and stability number in digraphs (Q2380212) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← links)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (Q2448966) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Sparse halves in triangle-free graphs (Q2496210) (← links)
- Bounding the number of edges in permutation graphs (Q2500963) (← links)
- Disjoint representability of sets and their complements (Q2565684) (← links)
- On a question of Erdős and Moser (Q2566606) (← links)
- A new lower bound for a Ramsey-type problem (Q2568501) (← links)
- Discrete Kakeya-type problems and small bases (Q2655785) (← links)
- A remark on Hamilton cycles with few colors (Q2657179) (← links)
- An average degree condition for independent transversals (Q2668023) (← links)
- Which graphs can be counted in \(C_4\)-free graphs? (Q2694950) (← links)
- Acyclic edge colorings of graphs (Q2746208) (← links)
- Random regular graphs of high degree (Q2746213) (← links)
- Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs (Q2765960) (← links)
- (Q2768278) (← links)
- (Q2768313) (← links)
- Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms (Q2784501) (← links)
- On the Maximum Quartet Distance between Phylogenetic Trees (Q2800184) (← links)
- Random directed graphs are robustly Hamiltonian (Q2820274) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← links)
- Longest cycles in sparse random digraphs (Q2844080) (← links)
- Self-Similarity of Graphs (Q2848546) (← links)
- The phase transition in random graphs: A simple proof (Q2852544) (← links)
- Cores of random graphs are born Hamiltonian (Q2874667) (← links)
- The Size of a Hypergraph and its Matching Number (Q2888870) (← links)
- Long cycles in subgraphs of (pseudo)random directed graphs (Q2897207) (← links)
- Getting a Directed Hamilton Cycle Two Times Faster (Q2911073) (← links)
- A Construction of Almost Steiner Systems (Q2935201) (← links)