We derive the exact one-step transition probabilities of the number of lineages that are ancestral to a random sample from the current generation of a bi-parental population that is evolving under the discrete Wright–Fisher model with n diploid individuals. Our model allows for a per-generation recombination probability of r. When r=1, our model is equivalent to Chang’s (Adv Appl Probab 31:1002–1038, 1999) model for the karyotic pedigree. When r=0, our model is equivalent to Kingman’s (Stoch Process Appl 13:235–248, 1982) discrete coalescent model for the cytoplasmic tree or sub-karyotic tree containing a DNA locus that is free of intra-locus recombination. When 0<r<1 our model can be thought to track a sub-karyotic ancestral graph containing a DNA sequence from an autosomal chromosome that has an intra-locus recombination probability r. Thus, our family of models indexed by r∈0,1 connects Kingman’s discrete coalescent to Chang’s pedigree in a continuous way as r goes from 0 to 1. For large populations, we also study three properties of the ancestral process corresponding to a given r∈(0,1): the time Tn to a most recent common ancestor (MRCA) of the population, the time Sn at which all individuals are either common ancestors of all present day individuals or ancestral to none of them, and the fraction of individuals that are common ancestors at time Sn. These results generalize the three main results of Chang’s (Adv Appl Probab 31:1002–1038, 1999). When we appropriately rescale time and recombination probability by the population size, our model leads to the continuous time Markov chain called the ancestral recombination graph of Hudson (Theor Popul Biol 23:183–201, 1983) and Griffiths (The two-locus ancestral graph, Institute of Mathematical Statistics 100–117, 1991).