Forbidden Subgraphs in Connected Graphs

Vlady Ravelomanana, Loys Thimonier

Given a set $\xi =\{H_1,H_2,...\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of as copy. Define the excess of a graph as the dif…