{"version":"1.0","type":"link","title":"Forcing graph - Newikis","description":"In graph theory, a forcing graph is one whose density determines whether a graph sequence is quasi-random. The term was first coined by Chung, Graham, and Wilson in 1989. Forcing graphs play an important role in the study of pseudorandomness in graph sequences.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}