Triangle-freeness is hard to detect

Combinatorics Probability and Computing

Volumn 11, Issue 6, 2002, Pages 549-569

  Jukna, S ^a,b   Schnitger, G ^a  

^a GOETHE UNIVERSITY   (Germany)

^b VILNIUS UNIVERSITY   (Lithuania)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; THEOREM PROVING;

BRANCHING PROGRAMS; COLOURING LEMMA; TRIANGLE-FREENESS;

GRAPH THEORY;

EID: 0036875154     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005333     Document Type: Article

References (14)

1. Ajtai, M. (1999) A non-linear time lower bound for boolean branching programs. In Proc. 40th Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 60-70.
2. Ajtai, M., Babai, L., Hajnal, P., Komlós, J., Pudlá, P., Röl, V., Szemerédi, E. and Turán, (1986) Two lower bounds for branching programs. In Proc. 18th Ann. ACM Symp. on the Theory of Computing, pp. 30-38.
3. Barefoot, C., Casey, K., Fisher, D., Fraughnaugh, K. and Harary, F. (1995) Size in maximal triangle-free graphs and minimal graphs of diameter 2. Discrete Math. 138 93-99.
4. Beame, P. W., Saks, M. and Thathachar, J. S. (2001) Time-space tradeoffs for branching programs. J. Comput. Syst. Sci. 63 542-572.
5. Beame, P., Saks, M., Sun, X. and Vee, E. (2000) Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. 41st Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 169-179.
6. Borodin, A., Razborov, A. and R. Smolensky (1993) On lower bounds for read-k times branching programs. Comput. Complexity 3 1-18.
7. Chung, F. R. K. (1997) Open problems of Paul Erdös in graph theory. J. Graph Theory 25 3-36.
8. Ďuriš, P., Hromkovič, J., Jukna, S., Sauerhoff, M. and Schnitger, G. (2001) On multipartition communication complexity. In Proc. 18th Int. Symp. on Theoretical Aspects of Computer Science, Vol. 2010 of Springer Lecture Notes in Computer Science, pp. 206-217.
9. Kleitman, D. J. and Winston, K. J. (1982) On the number of graphs without 4-cycles. Discrete Math. 41 167-172.
10. Kushilevitz, E. and Nisan, N. (1997) Communication Complexity, Cambridge University Press.
11. Papadimitriou, Ch. H. and Sipser, M. (1982) Communication complexity. In Proc. 14th Ann. ACM Symp. on the Theory of Computing, pp. 196-200. Journal version: Communication complexity, J. Comput. Syst. Sci. 28 2.
12. Simonovits, M. (1996) Paul Erdös' influence on extremal graph theory. In The Mathematics of Paul Erdös (J. Nes̃setr̃il and R. Graham, eds), Springer, pp. 148-192.
13. Wegener, I. (2000) Branching programs and Binary Decision Diagrams: Theory and Applications. SIAM Series in Discrete Mathematics and Applications.
14. Wilson, D. B. and Kleitman, D. J. On the number of graphs which lack small cycles. To appear in Discrete Math.