This web page lists papers citing my paper:

"A Note on the Independence Number of Triangle-Free Graphs", Discrete Mathematics, 46(1983), p. 83-87.

- J. Spencer, "Probabilistic Methods", Graphs and Combinatorics, 1(1985), p. 357-382.
- R. L. Graham and V. Rodl, "Numbers in Ramsey Theory", in Surveys in Combinatorics 1987, London Mathematics Society, Volume 123, p. 111-153.
- G. Hahn and B. Jackson, "A Note Concerning Paths and Indepen- dence Number in Digraphs", Discrete Mathematics, 82(1990), p. 327-329.
- S. P. Radziszowski and D. L. Kreher, "Minimum Triangle-Free Graphs", Ars Combinatoria, 31(1991), p. 65-92.
- Y. Caro and Z. Tuza, "Improved Lower Bounds on K-Independence", Journal of Graph Theory, 15(1991), p. 99-107.
- R. C. Brigham and R. D. Dutton, "A Compilation of Relations Between Graph Invariants - Supplement - 1", Networks, 21(1991), p. 421-455.
- J. Shearer, "A Note on the Independence Number of Triangle- Free Graphs II", Journal of Combinatorial Theory Series B, 53(1991), p. 300-307.
- Y. Kohayakawa and J. Wojciechowski, "On Small Graphs with Highly Imperfect Powers", Discrete Mathematics, 104(1992), p. 245-261.
- F. R. K. Chung, R. Cleve and P. Dagum, "A Note on Constructive Lower Bounds for the Ramsey Numbers-R(3,T)", Journal of Combinatorial Theory Series B, 57(1993), p. 150-155.
- Q. Zhu, "The largest transversal numbers of uniform hypergraphs", Discrete Mathematics, 147(1995), 271-282.
- S. Poljak and Z. Tuza, "Bipartite Subgraphs of Triangle-Free Graphs", Siam Journal on Discrete Mathematics, 7(1994), p. 307-313.
- T. Denley, "The independence number of graphs with large odd girth", The Electronic Journal of Combinatorics, 1(1994), #R9.
- N. Alon, "Explicit Ramsey Graphs and orthonormal labelings", The Electronic Journal of Combinatorics, 1(1994), #R12.
- M. M. Halldorsson and J. Radhakrishnan, "Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs", Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, p. 439-448.
- M. M. Halldorsson and J. Radhakrishnan, "Improved Approximations of Independent Sets in Bounded-Degree Graphs", 6th Scandinavian Workshop on Algorithm Theory, 1994, p. 195-206.
- N. Alon, "Tough Ramsey Graphs Without Short Cycles", Journal of Algebraic Combinatorics, 4(1995), p. 189-195.
- M. M. Halldorsson, "Approximating Discrete Collections via Local Improvements", Symposium on Discrete Algorithms, 1995, p. 160-169.
- J. H. Kim, "On Brooks' Theorem for Sparse Graphs", Combinatorics, Probability and computing, 4(1995), p. 97-132.
- J. H. Kim, "The Ramsey Number R(3,t) Has Order of Magnitude t**2/log t", Random Structures and Algorithms, 7(1995), p. 173-207.
- J. Kahn, "Asymptotically Good List-Colorings", Journal of Combinatorial Theory Series A, 73(1996), p. 1-59.
- T. Hofmeister and H. Lefmann, "Independent sets in graphs with triangles", Information Processing Letters, 58(1996), p. 207-210.
- Y. Li and C. C. Rousseau, "On Book-Complete Ramsey Numbers", Journal of Combinatorial Theory Series B, 68(1996), p 36-44.
- Y. Li and C. C. Rousseau, "Fan-Complete Graph Ramsey Numbers", Journal of Graph Theory, 23(1996), p. 413-420.
- N. Alon, "Independence Numbers of Locally Sparse Graphs and a Ramsey Type Problem", Random structures and Algorithms, 9(1996), p. 271-278.
- M. M. Halldorsson and J. Radhakrishnan, "Greed is Good: Approximating Independent Sets in Sparse and Bounded-degree Graphs", Algorithmica, 18(1997), p. 145-163.
- M. Krivelevich, "Approximate Set Covering in Uniform Hypergraphs", Journal of Algorithms, 25(1997), p. 118-143.
- V. T. Paschos, "A Survey of Approximately Optimal Solutions to Some covering and Packing Problems", ACM Computing Surveys, 29(1997), p. 171-209.
- M. Demange and V. T. Paschos, "Improved Approximations for Maximum Independent Set via Approximation Chains", Applied Mathematics Letters, 10(1997), p. 105-110.
- Y. Li and C. Rousseau, "On the Ramsey number r(H+Kn(bar),Kn), Discrete Mathematics, 170(1997), p. 265-267.
- A. Gyarfas, "Nonsymmetric Party Problems", Journal of Graph Theory, (28)1998, p.43-47.

[ IBM home page | Order | Search | Contact IBM | Legal ]