A. J. Radcliffe

According to our database1, A. J. Radcliffe authored at least 29 papers between 1990 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Many Cliques with Few Edges.
Electron. J. Comb., 2021

2020
Maximizing the density of Kt's in graphs of bounded degree and clique number.
Discret. Math., 2020

2019
Many Triangles with Few Edges.
Electron. J. Comb., 2019

2018
Extremal Threshold Graphs for Matchings and Independent Sets.
Graphs Comb., 2018

Minimizing the number of independent sets in triangle-free regular graphs.
Discret. Math., 2018

2017
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree.
J. Graph Theory, 2017

2016
Counting dominating sets and related structures in graphs.
Discret. Math., 2016

On the independence ratio of distance graphs.
Discret. Math., 2016

Graphs with the fewest matchings.
Comb., 2016

2014
Extremal Graphs for Homomorphisms II.
J. Graph Theory, 2014

The maximum number of complete subgraphs in a graph with given maximum degree.
J. Comb. Theory, Ser. B, 2014

2013
Hypergraph Independent Sets.
Comb. Probab. Comput., 2013

2012
Vertex Isoperimetric Inequalities for a Family of Graphs on ℤ<sup>k</sup>.
Electron. J. Comb., 2012

2011
Extremal graphs for homomorphisms.
J. Graph Theory, 2011

Negative Dependence and Srinivasan's Sampling Process.
Comb. Probab. Comput., 2011

Extremal Problems for Independent Set Enumeration.
Electron. J. Comb., 2011

An Entropy Proof of the Kahn-Lovász Theorem.
Electron. J. Comb., 2011

2006
Reconstructing under Group Actions.
Graphs Comb., 2006

2004
Semi-regular graphs of minimum independence number.
Discret. Math., 2004

2003
Finite Subsets of the Plane are 18-Reconstructible.
SIAM J. Discret. Math., 2003

1999
Reconstructing Subsets of Reals.
Electron. J. Comb., 1999

1998
Reconstructing Subsets of Z<sub>n</sub>.
J. Comb. Theory, Ser. A, 1998

1997
All trees contain a large induced subgraph having all degrees 1 (mod k).
Discret. Math., 1997

1996
Extremal Cases of the Ahlswede-Cai Inequality.
J. Comb. Theory, Ser. A, 1996

1995
Defect Sauer Results.
J. Comb. Theory, Ser. A, 1995

Every tree contains a large induced subgraph with all degrees odd.
Discret. Math., 1995

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs.
Comb. Probab. Comput., 1995

1994
Littlewood-Offord Inequalities for Random Variables.
SIAM J. Discret. Math., 1994

1990
Isoperimetric Inequalities for Faces of the Cube and the Grid.
Eur. J. Comb., 1990


  Loading...