English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49287/83828 (59%)
Visitors : 7148804      Online Users : 71
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/87463


    Title: 不含K2,3的二分極圖
    Other Titles: Extremal K2,3-free bipartite graphs
    Authors: 沈春梅;Shen, Chun-Mei
    Contributors: 淡江大學中等學校教師在職進修數學教學碩士學位班
    高金美;Fu, Chin-Mei Kau
    Keywords: Zarankiewicz問題;二分極圖;二分圖;圖的分割;完全圖;Zarankiewicz problem;extremal graph;bipartite graph;graph decomposition;complete graph.
    Date: 2012
    Issue Date: 2013-04-13 11:09:53 (UTC+8)
    Abstract: 一個不含K_2,2的二分極圖是一個含有最多邊數且不含有子圖K_2,2的二分圖。若此二分圖為K_m,n的子圖,則求此二分極圖的邊數的問題也就是出名的Zarankiewicz問題。在本論文中,我們令g(m,n)為K_m,n中不含K_2,3的二分極圖的邊數。我們得到一些結果。
    An extremal K_2,2-free bipartite graphs is a bipartite graph which contains the maximum number of edges and does not contain any subgraph K_2,2 . If this bipartite graph is a subgraph of K_m,n, then finding the number of edges of the extremal bipartite graph is the well-known Zarankiewicz Problem . In this thesis , we let be the number of edges of the extremal K_2,3-free bipartite graph which is a subgraph of K_m,n .We obtain some results.
    Appears in Collections:[數學學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML102View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback