Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Radcliffe, Jamie - Department of Mathematics, University of Nebraska-Lincoln
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
Extremal Cases of the AhlswedeCai Inequality A. J. Radcliffe and Zs. Szaniszl'o
Reconstructing subsets of Z n A.J. Radcliffe 1
Extremal Cases of the Ahlswede-Cai Inequality A. J. Radcli e and Zs. Szaniszlo
Defect Sauer Results Bela Bollobas
Defect Sauer Results B'ela Bollob'as
The maximum determinant of (\Sigma1)matrices M.G. Neubauer \Lambda and A.J. Radcliffe y
All trees contain a large induced sub graph having all degrees 1 (mod k)
NEGATIVE DEPENDENCE AND SRINIVASAN'S SAMPLING PROCESS JOSH BROWN KRAMER, JONATHAN CUTLER, AND A.J. RADCLIFFE
Abstract. The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. While independent sets in graphs are defined as sets of vertices
FINITE SUBSETS OF THE PLANE ARE 18-RECONSTRUCTIBLE.
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
ARTICLE IN PRESS Discrete Mathematics ( )
EXTREMAL GRAPHS FOR HOMOMORPHISMS JONATHAN CUTLER AND A.J. RADCLIFFE
AN ENTROPY PROOF OF THE KAHN-LOVASZ THEOREM JONATHAN CUTLER AND A.J. RADCLIFFE
SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 19, No. 1, pp. 224244
SIAM J. DISC. MATH. Vol. 7, No. 1, pp. 90-101, February 1994
The maximum determinant of ( 1)-matrices M.G. Neubauer and A.J. Radcli ey
Reconstructing subsets of Zn A.J. Radcli e 1
Reconstructing subsets of reals A.J. Radcliffe 1
SEMI-REGULAR GRAPHS OF MINIMUM INDEPENDENCE P. NELSON AND A. J. RADCLIFFE
Reconstructing under group actions A.J. Radcliffe1
All trees contain a large induced sub-graph having all degrees 1 (mod k)
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe