A. J. Radcliffe

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 10

Top Topics

Graph Theoretic

Top Venues

Electron. J. Comb.

J. Graph Theory

Publications

Jonathan Cutler, J. D. Nir, A. J. Radcliffe
Supersaturation for Subgraph Counts. Graphs Comb. 38 (3) (2022)
Rachel Kirsch, A. J. Radcliffe
Many Cliques with Few Edges. Electron. J. Comb. 28 (1) (2021)
Rachel Kirsch, A. J. Radcliffe
Maximizing the density of Kt's in graphs of bounded degree and clique number. Discret. Math. 343 (6) (2020)
Rachel Kirsch, A. J. Radcliffe
Many Triangles with Few Edges. Electron. J. Comb. 26 (2) (2019)
Lauren Keough, A. J. Radcliffe
Extremal Threshold Graphs for Matchings and Independent Sets. Graphs Comb. 34 (6) (2018)
Jonathan Cutler, A. J. Radcliffe
Minimizing the number of independent sets in triangle-free regular graphs. Discret. Math. 341 (3) (2018)
Jonathan Cutler, A. J. Radcliffe
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree. J. Graph Theory 84 (2) (2017)
Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe
The Multistep Friendship Paradox. Am. Math. Mon. 123 (9) (2016)
Jonathan Cutler, A. J. Radcliffe
Counting dominating sets and related structures in graphs. Discret. Math. 339 (5) (2016)
James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee
On the independence ratio of distance graphs. Discret. Math. 339 (12) (2016)
Jonathan Cutler, A. J. Radcliffe
Extremal Graphs for Homomorphisms II. J. Graph Theory 76 (1) (2014)
Jonathan Cutler, A. J. Radcliffe
The maximum number of complete subgraphs in a graph with given maximum degree. J. Comb. Theory, Ser. B 104 (2014)
Jonathan Cutler, A. J. Radcliffe
Hypergraph Independent Sets. Comb. Probab. Comput. 22 (1) (2013)
Jonathan Cutler, A. J. Radcliffe
Extremal graphs for homomorphisms. J. Graph Theory 67 (4) (2011)
Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe
Negative Dependence and Srinivasan's Sampling Process. Comb. Probab. Comput. 20 (3) (2011)
Jonathan Cutler, A. J. Radcliffe
Extremal Problems for Independent Set Enumeration. Electron. J. Comb. 18 (1) (2011)
Jonathan Cutler, A. J. Radcliffe
An Entropy Proof of the Kahn-Lovász Theorem. Electron. J. Comb. 18 (1) (2011)
C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi
On the interlace polynomials of forests. Discret. Math. 310 (1) (2010)
A. J. Radcliffe, Alex D. Scott
Reconstructing under Group Actions. Graphs Comb. 22 (3) (2006)
Patricia Nelson, A. J. Radcliffe
Semi-regular graphs of minimum independence number. Discret. Math. 275 (1-3) (2004)
Luke Pebody, A. J. Radcliffe, Alex D. Scott
Finite Subsets of the Plane are 18-Reconstructible. SIAM J. Discret. Math. 16 (2) (2003)
A. J. Radcliffe, Alex D. Scott
Reconstructing Subsets of Reals. Electron. J. Comb. 6 (1999)
A. J. Radcliffe, Alex D. Scott
. J. Comb. Theory, Ser. A 83 (2) (1998)
David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
All trees contain a large induced subgraph having all degrees 1 (mod k). Discret. Math. 175 (1-3) (1997)
A. J. Radcliffe, Zsuzsanna Szaniszló
Extremal Cases of the Ahlswede-Cai Inequality. J. Comb. Theory, Ser. A 76 (1) (1996)
Alan M. Frieze, A. J. Radcliffe, Stephen Suen
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. 4 (1995)
Béla Bollobás, A. J. Radcliffe
Defect Sauer Results. J. Comb. Theory, Ser. A 72 (2) (1995)
A. J. Radcliffe, Alex D. Scott
Every tree contains a large induced subgraph with all degrees odd. Discret. Math. 140 (1-3) (1995)
Imre Leader, A. J. Radcliffe
Littlewood-Offord Inequalities for Random Variables. SIAM J. Discret. Math. 7 (1) (1994)
Alan M. Frieze, A. J. Radcliffe, Stephen Suen
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA (1993)
Béla Bollobás, A. J. Radcliffe
Isoperimetric Inequalities for Faces of the Cube and the Grid. Eur. J. Comb. 11 (4) (1990)