Independence, clique size and maximum degree

DOI10.1007/BF02579154zbMATH Open0576.05025MaRDI QIDQ1065018FDOQ1065018

Authors: Siemion Fajtlowicz 

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3893236
• scientific article; zbMATH DE number 3853136
• GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
• The clique numbers of regular graphs
• Another note on cliques and independent sets

zbMATH Keywords

maximum degreeindependence numberButterfliesclique size

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the conjecture of Hajos
• Hajos' graph-coloring conjecture: Variations and counterexamples

Cited In (21)

• Conjectures of TxGraffiti: independence, domination, and matchings
• A note on coloring vertex-transitive graphs
• Transversals and independence in linear hypergraphs with maximum degree two
• A new lower bound on the independence number of a graph and applications
• Packing in regular graphs
• Title not available (Why is that?)
• On vertex independence number of uniform hypergraphs
• Title not available (Why is that?)
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• Zero forcing in claw-free cubic graphs
• On line graphs of subcubic triangle-free graphs
• Title not available (Why is that?)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
• The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
• An improved lower bound on the independence number of a graph
• Turán-type bounds for distance graphs
• Turán type results for distance graphs
• Perfect Roman domination in regular graphs
• New bounds on the independence number of connected graphs
• On three outer-independent domination related parameters in graphs
• Signed domination in regular graphs

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

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