For , define to be the theory of the generic -free graph, where is the complete graph on vertices. We prove a graph-theoretic characterization of dividing in and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, provides a counterexample to a question of Chernikov and Kaplan.
"Forking and Dividing in Henson Graphs." Notre Dame J. Formal Logic 58 (4) 555 - 566, 2017. https://doi.org/10.1215/00294527-2017-0016