# Browse Graduate Dissertations and Theses at Illinois by Title

• (2015-07-06)
We consider questions regarding the existence of graphs and hypergraphs with certain coloring properties and other structural properties. In Chapter 2 we consider color-critical graphs that are nearly bipartite and have ...

application/pdf

PDF (539kB)
• (2007)
A labeling of a graph is a bijective function from the set {1,2,...,|E|} onto the edges of the graph. The sum of the labels on edges incident to a vertex v is the vertex-sum at v. A labeling is antimagic if the vertex-sums ...

application/pdf

PDF (3MB)
• (2004)
Then, we consider packing problems for d-degenerate graphs. Two graphs G1 and G 2 pack if G1 is a subgraph of the complement G¯2 of G 2. We disprove one of the conjecture of Bollobas and Eldridge and prove an extension of ...

application/pdf

PDF (6MB)
• (2004)
We also show that lambda(G) = q 2 + q = Delta2 - Delta for the incidence graph G of the projective plane PG (2, q). To prove this result, we convert the problem to a problem of packing of bipartite graphs into a complete ...

application/pdf

PDF (3MB)
• (2001)
An r-edge-coloring of Kn is (r, m)-splittable if V (Kn) can then be r-colored to avoid totally monochromatic m-cliques (introduced by Erdo&huml;s and Gyarfas. We interpret such colorings using a two-round game against an ...

application/pdf

PDF (5MB)
• (2012-05-22)
In this thesis we study some extremal problems related to colorings and list colorings of graphs and hypergraphs. One of the main problems that we study is: What is the minimum number of edges in an $r$-uniform hypergraph ...

application/pdf

PDF (502kB)
• (1994)
This study examines the construction and negotiation of post-colonial identity in everyday life. Specifically, it addresses the mechanisms and practices by which a community of immigrants to the U.S. from the Indian ...

application/pdf

PDF (10MB)
• (2009)
Finally, the printing behavior of biphasic nanoparticle inks is investigated as a function of attractive-to-repulsive volume fraction and particle size ratio. Ink flow behavior is characterized by extrusion measurements, ...

application/pdf

PDF (5MB)
• (2005)
This paper examines Igor Stravinsky's serial practice in Canticum Sacrum (1955), specifically the relationship between the two twelve-tone series employed in the middle three movements. Two disparate investigations eventually ...

application/pdf

PDF (3MB)
• (2007)
Tumor growth suppression was associated with reduced proliferation and increased apoptosis, as quantified by Proliferating Cell Nuclear Antigen (PCNA) immunohistochemistry and the ApoptagRTM assay, respectively. Utilizing ...

application/pdf

PDF (4MB)
• (2000)
The study shows that hypothesis one is supported when the value of relevancy threshold is set to be documents that are at least partially relevant, that hypothesis two is not supported, and that hypotheses three and four ...

application/pdf

PDF (7MB)
• (2001)
This thesis highlighted combinatorial techniques in scientific computing as a research field full of interesting problems with real impact. From the scientific computing point of view, our results show that very significant ...

application/pdf

PDF (8MB)
• (1994)
Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.

application/pdf

PDF (2MB)
• (2014-09-16)
To compete in a market dominated by fossil fuels, biofuels must be economically competitive and also offer the variety of molecules and compounds which are currently derived from fossil fuels. This thesis offers potential ...

application/pdf

PDF (3MB)
• (2016-11-28)
A central task of coding theory is the design of schemes to reliably transmit data though space, via communication systems, or through time, via storage systems. Our goal is to identify and exploit structural properties ...

application/pdf

PDF (589kB)
• (1990)
In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network ...

application/pdf

PDF (4MB)
• (2013-02-03)
We describe several algorithms for classifying, comparing and optimizing curves on surfaces. We give algorithms to compute the minimum member of a given homology class, particularly computing the maximum flow and minimum ...

application/pdf

PDF (2MB)
• (1992)
An attempt is made to study the mathematical strength of the weak second order theories of Bounded Arithmetic U$\sbsp{2}{i}$ and V$\sbsp{2}{i}$, i $\geq$ 0, introduced by S. Buss. It is first shown that U$\sbsp{2}{1}$ can ...

application/pdf

PDF (3MB)
• (2013-05-24)
In this thesis, we develop a filtering process called combinatorial filters for handling combinatorial processes that evolve over time and study two practical problems using this method. The first problem is a generalization ...

application/pdf

PDF (6MB)
• (2013-05-24)
Using the SISR asymptotic, a classification of a class of scale-separated stochastic differential equations is achieved using combinatorics and formal language theory. This is extended to a topological notion of temperature ...

application/pdf

PDF (925kB)