Project Links Logo Artwork
Graph Theory: Industrial Drilling
Home > Graph Theory: Industrial Drilling > Foundations > Subgraphs and Supergraphs
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Subgraphs and Supergraphs

Problem 14:

What is the maximum number of edges that a graph with nodes can have if every path of length 2 in G is an induced subgraph?

Answer

Note: This is a difficult problem.

 
 
go backgo forward
go backgo forward