Pages that link to "Item:Q5287454"
From MaRDI portal
The following pages link to An upper bound on the number of cliques in a graph (Q5287454):
Displaying 36 items.
- Independent sets in graphs (Q501998) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- Graphs with the second largest number of maximal independent sets (Q998481) (← links)
- The maximum number of cliques in dense graphs (Q1061136) (← links)
- Maximum set of edges no two covered by a clique (Q1084407) (← links)
- On the number of edge disjoint cliques in graphs of given size (Q1180425) (← links)
- Bounds on the number of complete subgraphs (Q1195482) (← links)
- The number of maximal independent sets in connected triangle-free graphs (Q1292823) (← links)
- Struction revisited (Q1414580) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Boundary classes of graphs for the dominating set problem (Q1877644) (← links)
- Note on the structure of graphs with bounded clique number (Q1878828) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- A simple proof of the Gan-Loh-Sudakov conjecture (Q2088706) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Maximal independent sets in clique-free graphs (Q2674559) (← links)
- A new proof of the Fisher-Ryan bounds for the number of cliques of a graph (Q2716676) (← links)
- A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs (Q2915034) (← links)
- On the Number of<i>k</i>-Dominating Independent Sets (Q2978192) (← links)
- A recursive bound for the number of complete k-subgraphs of a graph (Q3348931) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- (Q3804726) (← links)
- (Q4953537) (← links)
- An upper bound for the number of maximal independent sets in a graph (Q5439059) (← links)
- Improved Bounds for Topological Cliques in Graphs of Large Girth (Q5470817) (← links)
- On the number of complete subgraphs contained in certain graphs (Q5724802) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- On cliques in graphs (Q5971413) (← links)
