#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1990

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, orâ€¦ (More)

- BÃ©la BollobÃ¡s, A. J. Radcliffe
- J. Comb. Theory, Ser. A
- 1995

- Jonathan Cutler, A. J. Radcliffe
- J. Comb. Theory, Ser. B
- 2014

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a d-regular graph on n vertices is at most (2 âˆ’â€¦ (More)

- Jonathan Cutler, A. J. Radcliffe
- Electr. J. Comb.
- 2011

The study of the number of independent sets in a graph has a rich history. Recently, Kahn proved that disjoint unions of Kr,râ€™s have the maximum number of independent sets amongst r-regular bipartiteâ€¦ (More)

- Jonathan Cutler, A. J. Radcliffe
- Journal of Graph Theory
- 2011

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular onâ€¦ (More)

- Jonathan Cutler, A. J. Radcliffe
- Journal of Graph Theory
- 2017

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices andâ€¦ (More)

- Alan M. Frieze, A. J. Radcliffe, Stephen Suen
- SODA
- 1993

We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if Î»n is the expected number of vertices not matched by MINGREEDY, thenâ€¦ (More)

The problem of deciding whether two graphs are isomorphic is fundamental in graph theory. Moreover, the flexibility with which other combinatorial objects can be modeled by graphs has meant thatâ€¦ (More)

- Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe
- Combinatorics, Probability & Computing
- 2011

In [1] Dubhashi, Jonasson, and Ranjan study the negative dependence properties of Srinivasanâ€™s sampling processes (SSPs), random processes which sample sets of a fixed size with prescribed marginals.â€¦ (More)

- Luke Pebody, A. J. Radcliffe, Alex D. Scott
- SIAM J. Discrete Math.
- 2003

We prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning theâ€¦ (More)