Triangle-free graphs whose independence number equals the degree

DOI10.1016/j.disc.2009.05.021zbMath1216.05097OpenAlexW2061073878MaRDI QIDQ960981

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

fractional chromatic numberindependence numbertriangle-free graphtoughness

Mathematics Subject Classification ID

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

Related Items

The independence number of circulant triangle-free graphs ⋮ On the Ramsey-Turán density of triangles ⋮ On dominator colorings in graphs ⋮ The Ramsey-Turán problem for cliques ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ K4$K_4$‐free graphs have sparse halves ⋮ Unnamed Item ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• Graphs whose every independent set has a common neighbour
• Triangle-free regular graphs
• Another infinite sequence of dense triangle-free graphs
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• A 4-colour problem for dense triangle-free graphs
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Toughness and triangle-free graphs
• Tough graphs and Hamiltonian circuits.
• Graph Theory and Probability
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• The fractional chromatic number of mycielski's graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Families of Non-disjoint subsets