
Applied Math Applied Math Forum 
 LinkBack  Thread Tools  Display Modes 
January 15th, 2013, 06:59 AM  #1 
Newbie Joined: Jan 2013 Posts: 19 Thanks: 0  Graphs without induced subgraphs with 3/4 edges?!
Hello there, I'd like to determine all Graphs that do not have any subgraph with 3 or 4 edges. Well, certainly all Graphs without 3 or 4 edges do not have such a subgraph. Well, the problem is quite the same i wrote in the first sentence : "Determine all Graphs that do not contain an induced subgraph with 3 or 4 subgraphs". Is 'induced' based on the edges or knots or.. ? Can you please help me? 

Tags 
3 or 4, edges, graphs, induced, subgraphs 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Question on isomorph Graphs and their complement Graphs  MageKnight  Applied Math  0  January 17th, 2013 10:38 PM 
Induced Subgraphs (Graph Theory)  Kramer  Real Analysis  1  August 2nd, 2012 09:39 AM 
Induced emf problem  dynas7y  Physics  2  June 10th, 2010 05:18 AM 
Spanning and Induced Subgraphs  dynas7y  Applied Math  1  December 9th, 2009 06:54 AM 
I wrote this in a drug induced trance...what does it mean?  3Arctan1  New Users  21  October 9th, 2009 03:57 PM 