The independence numbers of weighted graphs with forbidden cycles

DOI10.1007/978-3-030-93176-6_33zbMath1504.05121OpenAlexW4206832171MaRDI QIDQ2151383

Yan Li, Ye Wang

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_33

zbMATH Keywords

independence numberweighted graphrandom algorithmodd girth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (1)

Randomly finding independent sets in locally sparse graphs

Cites Work

• Unnamed Item
• An upper bound on the Ramsey numbers R(3,k)
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• The independence number of dense graphs with large odd girth
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• Lower bounds for small diagonal Ramsey numbers
• On book-complete graph Ramsey numbers
• On cycle—Complete graph ramsey numbers
• Independence numbers of locally sparse graphs and a Ramsey type problem
• Asymptotic upper bounds for Ramsey functions

This page was built for publication: The independence numbers of weighted graphs with forbidden cycles