Independence, clique size and maximum degree

DOI10.1007/BF02579154zbMath0576.05025MaRDI QIDQ1065018

Siemion Fajtlowicz

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

independence numbermaximum degreeButterfliesclique size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (17)

Transversals and independence in linear hypergraphs with maximum degree two ⋮ Turán type results for distance graphs ⋮ New bounds on the independence number of connected graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ On three outer-independent domination related parameters in graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Turán-type bounds for distance graphs ⋮ On vertex independence number of uniform hypergraphs ⋮ A new lower bound on the independence number of a graph and applications ⋮ Packing in regular graphs ⋮ An improved lower bound on the independence number of a graph ⋮ Perfect roman domination in regular graphs ⋮ Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three ⋮ Zero forcing in claw-free cubic graphs ⋮ Signed domination in regular graphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ A note on coloring vertex-transitive graphs

Cites Work

• Unnamed Item
• Hajos' graph-coloring conjecture: Variations and counterexamples
• On the conjecture of Hajos

This page was built for publication: Independence, clique size and maximum degree