Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Forbidden_subgraph_problem> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Forbidden_subgraph_problem abstract "In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G, find the maximal number of edges in an n-vertex graph which does not have a subgraph isomorphic to G. In this context, G is called a forbidden subgraph.It is also called the Turán-type problem and the corresponding number is called the Turán number for graph G. It is called so in memory of Pál Turán, who determined this number for all n and all complete graphs .An equivalent problem is how many edges in an n-vertex graph guarantee that it has a subgraph isomorphic to G?The problem may be generalized for a set of forbidden subgraphs S: find the maximal number of edges in an n-vertex graph which does not have a subgraph isomorphic to any graph form S.".
- Forbidden_subgraph_problem wikiPageID "21682838".
- Forbidden_subgraph_problem wikiPageRevisionID "606142635".
- Forbidden_subgraph_problem hasPhotoCollection Forbidden_subgraph_problem.
- Forbidden_subgraph_problem subject Category:Extremal_graph_theory.
- Forbidden_subgraph_problem comment "In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G, find the maximal number of edges in an n-vertex graph which does not have a subgraph isomorphic to G. In this context, G is called a forbidden subgraph.It is also called the Turán-type problem and the corresponding number is called the Turán number for graph G.".
- Forbidden_subgraph_problem label "Forbidden subgraph problem".
- Forbidden_subgraph_problem sameAs m.05mwpb3.
- Forbidden_subgraph_problem sameAs Q5467390.
- Forbidden_subgraph_problem sameAs Q5467390.
- Forbidden_subgraph_problem wasDerivedFrom Forbidden_subgraph_problem?oldid=606142635.
- Forbidden_subgraph_problem isPrimaryTopicOf Forbidden_subgraph_problem.