Independent sets in graphs with triangles

Information Processing Letters

Volumn 58, Issue 5, 1996, Pages 207-210

  Hofmeister, Thomas ^a   Lefmann, Hanno ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Algorithms; Independent sets

Indexed keywords

EID: 3943089702     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00072-5     Document Type: Article

References (10)

1. M. Ajtai, P. Erdös, J. Komlós and E. Szemerédi, On Turán's Theorem for sparse graphs, Combinatorica 1 (1981) 313-317.
2. M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A 29 (1980) 354-360.
3. M. Ajtai, J. Komlós and E. Szemerédi, A dense infinite Sidon sequence, European J. Combin. 2 (1981) 2-11.
4. [41 N. Alon and J. Spencer, The Probabilistic Method (Wiley, New York, 1992).
5. M. Halldórsson and J. Radhakrishnan, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, in: Proc. 26th ACM Symp. on Theory of Computing (1994) 439-448.
6. M. Halldórsson and J. Radhakrishnan, Improved approximations of independent sets in bounded-degree graphs via subgraph removal, Nordic J. Comput. 1 (1994) 475-492.
7. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci. 37 (1988) 130-143.
8. [8[ J. Shearer, A note on the independence number of triangle-free graphs, Discrete Math. 46 (1983) 83-87.
9. J. Shearer, A note on the independence number of triangle-free graphs, II, J. Combin. Theory 53 (1991) 300-307
10. J. Shearer, On the independence number of sparse graphs, to appear.