The following pages link to Benjamin Sudakov (Q1584432):
Displaying 50 items.
- (Q218253) (redirect page) (← links)
- Coloring random graphs (Q293318) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Some remarks on rainbow connectivity (Q322204) (← links)
- Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
- A random triadic process (Q322221) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- Ramsey goodness of paths (Q345089) (← links)
- Domination in 3-tournaments (Q346441) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Maximum union-free subfamilies (Q375829) (← links)
- On two problems in graph Ramsey theory (Q377800) (← links)
- An improved bound for the stepping-up lemma (Q385142) (← links)
- Two extensions of Ramsey's theorem (Q394821) (← links)
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- The minimum number of nonnegative edges in hypergraphs (Q405286) (← links)
- Hamiltonicity, independence number, and pancyclicity (Q412232) (← links)
- The size Ramsey number of a directed path (Q414648) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- Biased orientation games (Q418878) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- Bisections of graphs (Q461728) (← links)
- \(K_{s,t}\)-saturated bipartite graphs (Q482117) (← links)
- On the number of monotone sequences (Q490988) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- The extremal function for cycles of length \(\ell\) mod \(k\) (Q510312) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
- A conjecture of Erdős on graph Ramsey numbers (Q531812) (← links)
- Large almost monochromatic subsets in hypergraphs (Q532593) (← links)
- Increasing the chromatic number of a random graph (Q547868) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- Triangle factors in sparse pseudo-random graphs (Q558243) (← links)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← links)
- An approximate version of Sidorenko's conjecture (Q616156) (← links)
- Cycles in graphs with large independence ratio (Q635856) (← links)
- Generating all subsets of a finite set with disjoint unions (Q640845) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- On the value of a random minimum weight Steiner tree (Q705741) (← links)
- Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
- Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- 2-factors with \(k\) cycles in Hamiltonian graphs (Q777484) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- \(H\)-free graphs of large minimum degree (Q819178) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
