D. de Caen. Extensions of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria, 16:5--10, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An upper bound for the Turán number t_3(n, 4) - Chung, Lu (1998) (Correct)
....4) de Caen [3] gave an upper bound of 0:6213 which is the real root of 9x 46x 18. The best upper bound is due to Giraud (unpublished, see [3] who proved 21 1 6 = 5971 : We will show the following: Theorem 1 12 = 5936 : For general r graphs, de Caen [2], Sidorenko [6] Tazawa and Shirakura [9] proved Giraud (unpublished) improved this upper bound to r(1 r 4 ) for odd r: By similar methods as in the proof of Theorem 1, we have the following improvement: Theorem 2 For any odd r 3, we have We remark that the best lower bound was ....
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Comb. 16 (1983): 5-10.
An upper bound for the Turan number - Chung, Lu (Correct)
....of 9x 3 33x 2 46x 18. The best upper bound is due to Giraud (unpublished, see [3] who proved lim n## t 3 (n, 4) # n 3 # # # 21 1 6 = 5971 . We will show the following: Theorem 1 lim n## t 3 (n, 4) # n 3 # # 3 # 17 12 = 5936 . For general r graphs, de Caen [2], Sidorenko [6] Tazawa and Shirakura [9] proved lim n## t r (n, r 1) # n r # # 1 1 r Giraud (unpublished) improved this upper bound to lim n## t r (n, r 1) # n r # # 1 2 r(1 # r r 4 ) for odd r. By similar methods as in the proof of Theorem 1, we have the following ....
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Comb. 16 (1983): 5-10.
Exact Algorithms for Finding Minimum Transversals in Rank-3.. - Wahlström (2003) (Correct)
No context found.
D. de Caen. Extensions of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria, 16:5--10, 1983.
On Hypergraphs with Every Four Points Spanning at Most Two Triples - Mubayi (2003) (Correct)
No context found.
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983) 5--10.
Constructions and Bounds for (m, t)-Splitting Systems - Deng, Stinson, Li, van Rees, .. (2004) (Correct)
No context found.
D. de Caen. Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983), 5--10.
Constructions and Bounds for (m, t)-Splitting Systems - Deng, Stinson, Li, van Rees, .. (2003) (Correct)
No context found.
D. de Caen. Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983), 5--10.
On a two-sided Turán problem - Mubayi, Zhao (2003) (Correct)
No context found.
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combin. 16 (1983), 5-10.
On Hypergraphs with Every Four Points Spanning at Most Two Triples - Mubayi (2003) (Correct)
No context found.
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983) 5-10.
On a two-sided Turán problem - Mubayi, Zhao (2003) (Correct)
No context found.
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combin. 16 (1983), 5--10.
The Turán number of the Fano plane - Keevash, Sudakov (Correct)
No context found.
D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983), 5--10.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC