{"version":"1.0","type":"link","title":"Forbidden subgraph problem - Newikis","description":"In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph , find the maximal number of edges an -vertex graph can have such that it does not have a subgraph isomorphic to . In this context, is called a forbidden subgraph.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}