A. J. Radcliffe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2022

Supersaturation for Subgraph CountsJonathan Cutler, J. D. Nir, A. J. Radcliffe. gc, 38(3):65, 2022. [doi]

2021

Many Cliques with Few EdgesRachel Kirsch, A. J. Radcliffe. combinatorics, 28(1):1, 2021. [doi]

2020

Maximizing the density of Kt's in graphs of bounded degree and clique numberRachel Kirsch, A. J. Radcliffe. DM, 343(6):111803, 2020. [doi]

2019

Many Triangles with Few EdgesRachel Kirsch, A. J. Radcliffe. combinatorics, 26(2):2, 2019. [doi]

2018

Minimizing the number of independent sets in triangle-free regular graphsJonathan Cutler, A. J. Radcliffe. DM, 341(3):793-800, 2018. [doi]

Extremal Threshold Graphs for Matchings and Independent SetsLauren Keough, A. J. Radcliffe. gc, 34(6):1519-1537, 2018. [doi]

2017

The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum DegreeJonathan Cutler, A. J. Radcliffe. jgt, 84(2):134-145, 2017. [doi]

2016

On the independence ratio of distance graphsJames M. Carraher, David Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee. DM, 339(12):3058-3072, 2016. [doi]

Counting dominating sets and related structures in graphsJonathan Cutler, A. J. Radcliffe. DM, 339(5):1593-1599, 2016. [doi]

The Multistep Friendship ParadoxJoshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe. tamm, 123(9):900-908, 2016. [doi]

2014

Extremal Graphs for Homomorphisms IIJonathan Cutler, A. J. Radcliffe. jgt, 76(1):42-59, 2014. [doi]

The maximum number of complete subgraphs in a graph with given maximum degreeJonathan Cutler, A. J. Radcliffe. JCT, 104:60-71, 2014. [doi]

2013

Hypergraph Independent SetsJonathan Cutler, A. J. Radcliffe. cpc, 22(1):9-20, 2013. [doi]

2011

Extremal graphs for homomorphismsJonathan Cutler, A. J. Radcliffe. jgt, 67(4):261-284, 2011. [doi]

An Entropy Proof of the Kahn-Lovász TheoremJonathan Cutler, A. J. Radcliffe. combinatorics, 18(1), 2011. [doi]

Extremal Problems for Independent Set EnumerationJonathan Cutler, A. J. Radcliffe. combinatorics, 18(1), 2011. [doi]

Negative Dependence and Srinivasan s Sampling ProcessJosh Brown Kramer, Jonathan Cutler, A. J. Radcliffe. cpc, 20(3):347-361, 2011. [doi]

2010

On the interlace polynomials of forestsC. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi. DM, 310(1):31-36, 2010. [doi]

2006

Reconstructing under Group ActionsA. J. Radcliffe, Alex D. Scott. gc, 22(3):399-419, 2006. [doi]

2004

Semi-regular graphs of minimum independence numberPatricia Nelson, A. J. Radcliffe. DM, 275(1-3):237-263, 2004. [doi]

2003

Finite Subsets of the Plane are 18-ReconstructibleLuke Pebody, A. J. Radcliffe, Alex D. Scott. siamdm, 16(2):262-275, 2003. [doi]

1999

Reconstructing Subsets of RealsA. J. Radcliffe, Alex D. Scott. combinatorics, 6, 1999. [doi]

1998

Reconstructing Subsets of Z::n::A. J. Radcliffe, Alex D. Scott. JCT, 83(2):169-187, 1998. [doi]

1997

All trees contain a large induced subgraph having all degrees 1 (mod k)David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang 0022, Larry Wargo. DM, 175(1-3):35-40, 1997. [doi]

1996

Extremal Cases of the Ahlswede-Cai InequalityA. J. Radcliffe, Zsuzsanna Szaniszló. JCT, 76(1):108-120, 1996. [doi]

1995

Defect Sauer ResultsBéla Bollobás, A. J. Radcliffe. JCT, 72(2):189-208, 1995.

Analysis of a Simple Greedy Matching Algorithm on Random Cubic GraphsAlan M. Frieze, A. J. Radcliffe, Stephen Suen. cpc, 4:47-66, 1995.

Every tree contains a large induced subgraph with all degrees oddA. J. Radcliffe, Alex D. Scott. DM, 140(1-3):275-279, 1995. [doi]

1994

Littlewood-Offord Inequalities for Random VariablesImre Leader, A. J. Radcliffe. siamdm, 7(1):90-101, 1994. [doi]

1993

Analysis of a Simple Greedy Matching Algorithm on Random Cubic GraphsAlan M. Frieze, A. J. Radcliffe, Stephen Suen. soda 1993: 341-351

1990

Isoperimetric Inequalities for Faces of the Cube and the GridBéla Bollobás, A. J. Radcliffe. ejc, 11(4):323-333, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL