Pages that link to "Item:Q995772"

The following pages link to On the maximum number of cliques in a graph (Q995772):

Displaying 46 items.

• Cliques in graphs excluding a complete graph minor (Q311514) (← links)
• Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
• Independent sets in graphs (Q501998) (← links)
• On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
• Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
• Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
• The maximum number of cliques in dense graphs (Q1061136) (← links)
• Clique numbers of graphs (Q1071785) (← links)
• The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
• The Hosoya index and the Merrifield-Simmons index (Q1713982) (← links)
• Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
• The maximum number of 3- and 4-cliques within a planar maximally filtered graph (Q1783249) (← links)
• Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
• Local planar domination revisited (Q2097345) (← links)
• Counting cliques in 1-planar graphs (Q2111191) (← links)
• Supersaturation for subgraph counts (Q2117531) (← links)
• Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
• Homomorphisms into loop-threshold graphs (Q2185229) (← links)
• Many cliques with few edges (Q2223482) (← links)
• A note on Turán's theorem (Q2279574) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← links)
• An extended depth-first search algorithm for optimal triangulation of Bayesian networks (Q2374531) (← links)
• On the number of cliques in graphs with a forbidden minor (Q2399355) (← links)
• Many triangles with few edges (Q2420564) (← links)
• The maximum number of complete subgraphs in a graph with given maximum degree (Q2434716) (← links)
• The sum of degrees in cliques (Q2583673) (← links)
• Generalized planar Turán numbers (Q2665977) (← links)
• The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree (Q2958203) (← links)
• Number of Cliques in Graphs with a Forbidden Subdivision (Q3449861) (← links)
• (Q3706082) (← links)
• (Q3804726) (← links)
• On cliques of graphs (Q3976610) (← links)
• (Q3980562) (← links)
• On graphs having prescribed clique number, chromatic number, and maximum degree (Q4186359) (← links)
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs (Q4644780) (← links)
• Tree densities in sparse graph classes (Q5046563) (← links)
• (Q5135778) (← links)
• On the clique number of the square of a line graph and its relation to maximum degree of the line graph (Q5207468) (← links)
• An upper bound on the number of cliques in a graph (Q5287454) (← links)
• On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (Q5855529) (← links)
• Subgraph densities in a surface (Q5886343) (← links)
• On supersaturation and stability for generalized Turán problems (Q6055938) (← links)
• The maximum number of paths of length three in a planar graph (Q6057639) (← links)
• Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
• A localized approach to generalized Turán problems (Q6614190) (← links)
• The maximum number of pentagons in a planar graph (Q6657591) (← links)