Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Ramsey-Turan"”.

  1. Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-16T19:15:45Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Hu_Ping.pdf: 911457 bytes, checksum: d58f34d1ea93d149457db170269d9561 (MD5)

    uiuc Repository record for Extremal graph theory: flag algebras, Ramsey-Turan numbers, chromatic thresholds, and sparse hypergraphs (opens in a new tab)

  2. Extremal graph theory: Ramsey-Turán numbers, chromatic thresholds, and minors

    … first two parts focus on questions motivated by Turan's Theorem and the third part investigates a problem related to Hadwiger's Conjecture. Let H be a graph, t an integer, and f(n) a function. The t-Ramsey-Turan number of H, RT_t(n,H,f(n)), is the maximum number of edges in an n-vertex, H-free …

    uiuc Repository record for Extremal graph theory: Ramsey-Turán numbers, chromatic thresholds, and minors (opens in a new tab)

  3. Embedding problems and Ramsey-Turán variations in extremal graph theory

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2018-08-01

    uiuc Repository record for Embedding problems and Ramsey-Turán variations in extremal graph theory (opens in a new tab)