The following pages link to Peter Keevash (Q388724):
Displayed 50 items.
- A hypergraph Turán theorem via Lagrangians of intersecting families (Q388725) (← links)
- An approximate vertex-isoperimetric inequality for \(r\)-sets (Q396930) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- Bounded direction-length frameworks (Q542392) (← links)
- Necessary conditions for the global rigidity of direction-length frameworks (Q542393) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (Q859617) (← links)
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Pancyclicity of Hamiltonian and highly connected graphs (Q974472) (← links)
- The early evolution of the \(H\)-free process (Q982189) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- On the number of edges not covered by monochromatic copies of a fixed graph. (Q1425108) (← links)
- Counting Steiner triple systems (Q1620862) (← links)
- A stability result for the cube edge isoperimetric inequality (Q1689050) (← links)
- Equiangular lines and subspaces in Euclidean spaces (Q1689890) (← links)
- Equiangular lines and spherical codes in Euclidean space (Q1692197) (← links)
- Counting designs (Q1746198) (← links)
- Item:Q388724 (redirect page) (← links)
- The characteristic polynomial of a random permutation matrix. (Q1879500) (← links)
- Stability theorems for cancellative hypergraphs (Q1880797) (← links)
- Multicoloured extremal problems (Q1883144) (← links)
- Multicolour Turán problems (Q1883379) (← links)
- A universal exponent for homeomorphs (Q2048857) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- Global rigidity of direction-length frameworks (Q2200920) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- A multipartite Hajnal-Szemerédi theorem (Q2349514) (← links)
- The Turán number of the Fano plane (Q2368588) (← links)
- On a hypergraph Turán problem of Frankl (Q2368596) (← links)
- Codegree problems for projective geometries (Q2384802) (← links)
- On a conjecture of Erdős and Simonovits: even cycles (Q2439838) (← 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)
- The Turán problem for projective geometries (Q2566808) (← links)
- The Turán problem for hypergraphs on fixed size (Q2571304) (← links)
- The generalised Oberwolfach problem (Q2664557) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Digraph Girth via Chromatic Number (Q2848530) (← links)
- The Turán Number of<i>F</i><sub>3,3</sub> (Q2888871) (← links)
- A Semiexact Degree Condition for Hamilton Cycles in Digraphs (Q3008005) (← links)
- (Q3089368) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Finding Hamilton cycles in robustly expanding digraphs (Q3143742) (← links)
- Packing triangles in a graph and its complement (Q3159377) (← links)
- Rainbow Matchings in Properly Colored Multigraphs (Q3174698) (← links)