Results

**1 - 2**of**2**
by Colin McDiarmid

Venue: | J. Graph Theory |

Sorted by:

Results **1 -
2** of
**2**

by
Aaron Abrams, Rod Canfield, Andrew Granville

"... The number of possibilities for random dating ..."

(Show Context)
Citation Context

... the main theorem uses a simple inclusion-exclusion argument. It is not hard to prove a result for more general graphs G and H as indicated in the proof, though this would be complicated to state. In =-=[4]-=- McDiarmid proves these results in the special case that G = Kn though with more examples of desired subgraphs (that is, other than just for matchings and for Hamiltonian cycles). In our proof, in sec...

by
Aaron Abrams, Rod Canfield, Andrew Granville

"... The number of possibilities for random dating ..."

(Show Context)
Citation Context

... the main theorem uses a simple inclusion-exclusion argument. It is not hard to prove a result for more general graphs G and H as indicated in the proof, though this would be complicated to state. In =-=[3]-=- McDiarmid proves these results in the special case that G = Kn though with more examples of desired subgraphs (that is, other than just for matchings and for Hamiltonian cycles). In our proof, in sec...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University