Pages that link to "Item:Q5287443"

The following pages link to Sharp bounds on the order, size, and stability number of graphs (Q5287443):

Displaying 11 items.

• Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph (Q414654) (← links)
• An improved lower bound on the independence number of a graph (Q477342) (← links)
• Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
• Improving an upper bound on the stability number of a graph (Q556012) (← links)
• The \(k\)-regular induced subgraph problem (Q1786867) (← links)
• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• A note on the stability number of an orthogonality graph (Q2643845) (← links)
• New bounds on the independence number of connected graphs (Q4554556) (← links)
• (Q4876132) (← links)
• A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\) (Q6658088) (← links)