The following pages link to Andrew John Radcliffe (Q456298):
Displayed 41 items.
- Item:Q456298 (redirect page) (← links)
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\) (Q456299) (← links)
- Graphs with the fewest matchings (Q524194) (← links)
- An entropy proof of the Kahn-Lovász theorem (Q625372) (← links)
- Extremal problems for independent set enumeration (Q640424) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- Reconstructing under group actions. (Q855305) (← links)
- Isoperimetric inequalities for faces of the cube and the grid (Q916673) (← links)
- Reconstructing subsets of \(\mathbb{Z}_n\) (Q1269888) (← links)
- Reconstructing subsets of reals (Q1283873) (← links)
- The maximum determinant of \(\pm 1\) matrices (Q1355220) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- Minimizing the number of independent sets in triangle-free regular graphs (Q1690246) (← links)
- Extremal threshold graphs for matchings and independent sets (Q1756116) (← links)
- Every tree contains a large induced subgraph with all degrees odd (Q1893180) (← links)
- Defect Sauer results (Q1903004) (← links)
- Extremal cases of the Ahlswede-Cai inequality (Q1924240) (← links)
- A comparison between a symmetric and a non-symmetric Galerkin finite element-boundary integral equation coupling for the two-dimensional exterior Stokes problem (Q1944560) (← links)
- Signatures of strings (Q1950426) (← links)
- Supersaturation for subgraph counts (Q2117531) (← links)
- Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573) (← links)
- Many cliques with few edges (Q2223482) (← links)
- Many triangles with few edges (Q2420564) (← links)
- The maximum number of complete subgraphs in a graph with given maximum degree (Q2434716) (← links)
- FEM-BEM coupling for the exterior Stokes problem with non-conforming finite elements and an application to small droplet deformation dynamics (Q2900448) (← links)
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree (Q2958203) (← links)
- Negative Dependence and Srinivasan's Sampling Process (Q2998849) (← links)
- (Q3140438) (← links)
- (Q3620818) (← links)
- Reverse Kleitman Inequalities (Q3827176) (← links)
- (Q4033753) (← links)
- Littlewood-Offord Inequalities for Random Variables (Q4287942) (← links)
- Finite Subsets of the Plane are 18-Reconstructible (Q4443083) (← links)
- The Multistep Friendship Paradox (Q4576560) (← links)
- Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs (Q4844489) (← links)
- Hypergraph Independent Sets (Q4903260) (← links)
- Extremal graphs for homomorphisms (Q5199417) (← links)
- Non‐conforming finite elements for axisymmetric charged droplet deformation dynamics and Coulomb explosions (Q5216472) (← links)
- Reversals and Transpositions Over Finite Alphabets (Q5317611) (← links)
- Extremal Graphs for Homomorphisms II (Q5418768) (← links)