Independence in connected graphs (Q617904): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:12, 3 July 2024

scientific article

Language	Label	Description	Also known as
English	Independence in connected graphs	scientific article

Statements

scholarly article

0 references

Independence in connected graphs (English)

0 references

0 references

Dieter Rautenbach

0 references

Discrete Applied Mathematics

0 references

publication date

14 January 2011

0 references

full work available at URL

https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00018947/IfM_Preprint_M09_31.pdf

0 references

zbMATH Keywords

independence

0 references

stability

0 references

connected graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

On Turan's theorem for sparse graphs

0 references

A note on Ramsey numbers

0 references

A dense infinite Sidon sequence

0 references

On the independence number of a graph in terms of order and size

0 references

A lower bound on the independence number of a graph in terms of degrees

0 references

Clique is hard to approximate within \(n^{1-\epsilon}\)

0 references

Foreword: Special issue on stability in graphs and related topics

0 references

0 references

A note on the independence number of triangle-free graphs

0 references

A note on the independence number of triangle-free graphs. II

0 references

Some Ramsey-Type Numbers and the Independence Ratio

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2010.08.029

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:617904

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q617904&oldid=35208582"