Pages that link to "Item:Q2434716"
From MaRDI portal
The following pages link to The maximum number of complete subgraphs in a graph with given maximum degree (Q2434716):
Displaying 25 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Independent sets in graphs (Q501998) (← links)
- On the number of \(r\)-matchings in a tree (Q510338) (← links)
- A reverse Sidorenko inequality (Q785934) (← links)
- Minimizing the number of independent sets in triangle-free regular graphs (Q1690246) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
- Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573) (← links)
- Homomorphisms into loop-threshold graphs (Q2185229) (← links)
- Many cliques with few edges (Q2223482) (← links)
- The number of independent sets in an irregular graph (Q2312617) (← links)
- Many triangles with few edges (Q2420564) (← links)
- Maximizing the number of independent sets in claw-free cubic graphs (Q2698077) (← links)
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree (Q2958203) (← links)
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms (Q4575432) (← links)
- Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- Maximizing the Number of Independent Sets of a Fixed Size (Q5364240) (← links)
- Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
- Tight bounds on the coefficients of partition functions via stability (Q5915725) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
- Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (Q6640963) (← links)
