Pages that link to "Item:Q995772"
From MaRDI portal
The following pages link to On the maximum number of cliques in a graph (Q995772):
Displayed 28 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)
- The Hosoya index and the Merrifield-Simmons index (Q1713982) (← 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)
- A note on Turán's theorem (Q2279574) (← 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)
- 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)
- 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 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)
- Planar graphs with the maximum number of induced 6-cycles (Q6197310) (← links)