A. J. Radcliffe

31 papers A* 1Journal 30

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