Pages that link to "Item:Q4575432"
From MaRDI portal
The following pages link to Extremal Regular Graphs: Independent Sets and Graph Homomorphisms (Q4575432):
Displaying 15 items.
- A reverse Sidorenko inequality (Q785934) (← links)
- Minimizing the number of independent sets in triangle-free regular graphs (Q1690246) (← links)
- Maximizing and minimizing the number of generalized colorings of trees (Q1727776) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
- Homomorphisms into loop-threshold graphs (Q2185229) (← links)
- Counting independent sets in regular hypergraphs (Q2229168) (← links)
- On the number of independent sets in uniform, regular, linear hypergraphs (Q2237850) (← links)
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets (Q2278638) (← links)
- The number of independent sets in an irregular graph (Q2312617) (← 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)
