The following pages link to Benjamin Sudakov (Q1584432):
Displayed 50 items.
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (Q859617) (← links)
- Small subgraphs of random regular graphs (Q882118) (← links)
- Induced subgraphs of Ramsey graphs with many distinct degrees (Q885296) (← links)
- On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs (Q947730) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Embedding nearly-spanning bounded degree trees (Q950331) (← links)
- Unavoidable patterns (Q958758) (← links)
- Pancyclicity of Hamiltonian and highly connected graphs (Q974472) (← links)
- Density theorems for bipartite graphs and related Ramsey-type results (Q987552) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Minors in expanding graphs (Q1028516) (← links)
- Two remarks on the Burr-Erdős conjecture (Q1039436) (← links)
- A note on \(\tau\)-critical linear hypergraphs (Q1376067) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- On the largest eigenvalue of a random subgraph of the hypercube (Q1404744) (← links)
- A few remarks on Ramsey--Turán-type problems (Q1405104) (← links)
- On the number of edges not covered by monochromatic copies of a fixed graph. (Q1425108) (← links)
- Extremal set systems with restricted \(k\)-wise intersections. (Q1427014) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- Note on alternating directed cycles (Q1584433) (← links)
- Supersaturation in posets and applications involving the container method (Q1679331) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- Equiangular lines and subspaces in Euclidean spaces (Q1689890) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- Anagram-free colorings of graphs (Q1689991) (← links)
- Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046) (← links)
- Equiangular lines and spherical codes in Euclidean space (Q1692197) (← links)
- Equiangular subspaces in Euclidean spaces (Q1739198) (← links)
- Cycles in triangle-free graphs of large chromatic number (Q1743172) (← links)
- Graph products, Fourier analysis and spectral techniques (Q1764292) (← links)
- Nowhere-zero flows in random graphs (Q1850523) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- Multicolour Turán problems (Q1883379) (← links)
- Rainbow Turán problem for even cycles (Q1943398) (← links)
- List coloring of random and pseudo-random graphs (Q1977428) (← links)
- Isomorphic bisections of cubic graphs (Q1984530) (← links)
- An algebraic perspective on integer sparse recovery (Q2007643) (← links)
- Flattening rank and its combinatorial applications (Q2032245) (← links)
- Tournament quasirandomness from local counting (Q2036620) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Infinite Sperner's theorem (Q2068601) (← links)
- Threshold Ramsey multiplicity for paths and even cycles (Q2080232) (← links)
- Lower bounds for max-cut via semidefinite programming (Q2081648) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- \(C_4\)-free subgraphs with large average degree (Q2130532) (← links)