A hypergraph regularity method for linear hypergraphs

A hypergraph regularity method for linear hypergraphs

Szemerédi's Regularity Lemma is powerful tool in Graph Theory, yielding many applications in areas such as Extremal Graph Theory, Combinatorial Number Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rödl, Schacht...

Full description

Bibliographic Details
Main Author: Khan, Shoaib Amjad
Format: Others
Published: Scholar Commons 2009
Subjects:
Regularity lemma
Counting lemma
Forbidden families
F-counting algorithm
Constructive removal lemma
American Studies
Arts and Humanities
Online Access:http://scholarcommons.usf.edu/etd/2042
http://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=3041&context=etd

Internet

http://scholarcommons.usf.edu/etd/2042
http://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=3041&context=etd

Similar Items