| ชื่อเรื่อง | : | On extremal k-graphs without repeated copies of 2-intersecting edges |
| นักวิจัย | : | Chee, Yeow Meng , Ling, Alan C. H. |
| คำค้น | : | DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics |
| หน่วยงาน | : | Nanyang Technological University, Singapore |
| ผู้ร่วมงาน | : | - |
| ปีพิมพ์ | : | 2550 |
| อ้างอิง | : | Chee, Y. M., & Ling, A. C. H. (2007). On extremal k-graphs without repeated copies of 2-intersecting edges. Siam Journal on Discrete Mathematics, 21(3), 805–821. , 0895-4801 , http://hdl.handle.net/10220/6035 , http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:ELSEVIER_SCOPUS&id=doi:&genre=&isbn=&issn=&date=2007&volume=21&issue=3&spage=805&epage=821&aulast=Chee&aufirst=%20Y%20M&auinit=&title=SIAM%20Journal%20on%20Discrete%20Mathematics&atitle=On%20extremal%20k%2Dgraphs%20without%20repeated%20copies%20of%202%2Dintersecting%20edges , http://dx.doi.org/10.1137/060675915 |
| ที่มา | : | - |
| ความเชี่ยวชาญ | : | - |
| ความสัมพันธ์ | : | Siam journal on discrete mathematics |
| ขอบเขตของเนื้อหา | : | - |
| บทคัดย่อ/คำอธิบาย | : | The problem of determining extremal hypergraphs containing at most r isomorphic copies of some element of a given hypergraph family was first studied by Boros et al. in 2001. There are not many hypergraph families for which exact results are known concerning the size of the corresponding extremal hypergraphs, except for those equivalent to the classical Turán numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k ∈ {3, 4}. We give a complete solution when k = 3 and an almost complete solution (with eleven exceptions) when k = 4. |
| บรรณานุกรม | : |
Chee, Yeow Meng , Ling, Alan C. H. . (2550). On extremal k-graphs without repeated copies of 2-intersecting edges.
กรุงเทพมหานคร : Nanyang Technological University, Singapore. Chee, Yeow Meng , Ling, Alan C. H. . 2550. "On extremal k-graphs without repeated copies of 2-intersecting edges".
กรุงเทพมหานคร : Nanyang Technological University, Singapore. Chee, Yeow Meng , Ling, Alan C. H. . "On extremal k-graphs without repeated copies of 2-intersecting edges."
กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2550. Print. Chee, Yeow Meng , Ling, Alan C. H. . On extremal k-graphs without repeated copies of 2-intersecting edges. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2550.
|
ridm@nrct.go.th ระบบคลังข้อมูลงานวิจัยไทย รายการโปรดที่คุณเลือกไว้
