Triangle-free graphs whose independence number equals the degree

DOI10.1016/J.DISC.2009.05.021MaRDI QIDQ960981zbMATHOpenAlexFDO

Authors Stephan Brandt

Publication date 29 March 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.05.021

zbMATH Keywords

independence numbertoughnesstriangle-free graphfractional chromatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
• On the chromatic number of triangle-free graphs of large minimum degree
• scientific article; zbMATH DE number 1151823
• A note on the independence number of triangle-free graphs. II
• Size and independence in triangle‐free graphs with maximum degree three

Cites work

• scientific article; zbMATH DE number 4177077 (Why is no real title available?)
• scientific article; zbMATH DE number 3587083 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 1107725 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 845597 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• A 4-colour problem for dense triangle-free graphs
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs
• Another infinite sequence of dense triangle-free graphs
• Families of Non-disjoint subsets
• Graph Theory and Probability
• Graphs whose every independent set has a common neighbour
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The fractional chromatic number of mycielski's graphs
• Tough Ramsey graphs without short cycles
• Tough graphs and Hamiltonian circuits.
• Toughness and spectrum of a graph
• Toughness and triangle-free graphs
• Triangle-free regular graphs

Cited in

(13)

• scientific article; zbMATH DE number 845597 (Why is no real title available?)
• K4$K_4$‐free graphs have sparse halves
• Toughness in graphs -- a survey
• Independent triangles covering given vertices of a graph
• Two-colored Ramsey-Turán densities involving triangles
• On dominator colorings in graphs
• Two Conjectures in Ramsey--Turán Theory
• On the Ramsey-Turán density of triangles
• A counterexample on the conjecture and bounds on \(\chi_{gd}\)-number of Mycielskian of a graph
• Andrásfai and Vega graphs in Ramsey–Turán theory
• The independence number of circulant triangle-free graphs
• scientific article; zbMATH DE number 1151823 (Why is no real title available?)
• The Ramsey-Turán problem for cliques

This page was built for publication: Triangle-free graphs whose independence number equals the degree

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