Lower bounds for independence numbers of some locally sparse graphs

DOI10.1007/S10878-012-9578-4zbMATH Open1307.90189OpenAlexW2007325280MaRDI QIDQ489716FDOQ489716

Authors: Yusheng Li, Qizhong Lin 

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9578-4

Recommendations

• Randomly finding independent sets in locally sparse graphs
• Independence numbers of locally sparse graphs and a Ramsey type problem
• New lower bounds for the independence number of sparse graphs and hypergraphs
• Coloring graphs with locally few colors
• On the independence number of sparse graphs

zbMATH Keywords

independence numberlocally distinct coloringlocally sparse graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a problem of K. Zarankiewicz
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• Cycles of even length in graphs
• On book-complete graph Ramsey numbers
• Coloring graphs with sparse neighborhoods
• On cycle—Complete graph ramsey numbers
• Independence numbers of locally sparse graphs and a Ramsey type problem
• Asymptotic upper bounds for Ramsey functions
• The independence number of dense graphs with large odd girth
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• A note on odd cycle-complete graph Ramsey numbers
• Ramsey numbers of some bipartite graphs versus complete graphs

Cited In (4)

• Randomly finding independent sets in locally sparse graphs
• On the Lovász Theta Function for Independent Sets in Sparse Graphs
• Independent transversals in locally sparse graphs
• Sparse hypergraphs with low independence number

This page was built for publication: Lower bounds for independence numbers of some locally sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489716)