Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"University of Illinois – Urbana-Champaign" +contributor:("Balogh, Jozsef")`

.
Showing records 1 – 9 of
9 total matches.

▼ Search Limiters

University of Illinois – Urbana-Champaign

1. Wagner, Zsolt Adam. On some problems in extremal, probabilistic and enumerative combinatorics.

Degree: PhD, Mathematics, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/100954

► This is a study of a small selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a…
(more)

Subjects/Keywords: extremal combinatorics; probabilistic combinatorics; enumerative combinatorics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wagner, Z. A. (2018). On some problems in extremal, probabilistic and enumerative combinatorics. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100954

Chicago Manual of Style (16^{th} Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/100954.

MLA Handbook (7^{th} Edition):

Wagner, Zsolt Adam. “On some problems in extremal, probabilistic and enumerative combinatorics.” 2018. Web. 16 Jul 2020.

Vancouver:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/100954.

Council of Science Editors:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100954

University of Illinois – Urbana-Champaign

2. Liu, Hong. Extremal graph theory: supersaturation and enumeration.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/89148

► In this thesis, we study supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with *Balogh*, we disprove a conjecture of Erdos and Tuza…
(more)

Subjects/Keywords: Supersaturation; Enumeration; Typical Structure; Extremal Combinatorics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liu, H. (2015). Extremal graph theory: supersaturation and enumeration. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89148

Chicago Manual of Style (16^{th} Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/89148.

MLA Handbook (7^{th} Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Web. 16 Jul 2020.

Vancouver:

Liu H. Extremal graph theory: supersaturation and enumeration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/89148.

Council of Science Editors:

Liu H. Extremal graph theory: supersaturation and enumeration. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89148

3. Yager, Derrek Jordan Dinius. Sufficient degree conditions for graph embeddings.

Degree: PhD, Mathematics, 2019, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/105617

► In this dissertation, we focus on the sufficient conditions to guarantee one graph being the subgraph of another. In Chapter 2, we discuss list packing,…
(more)

Subjects/Keywords: Combinatorics; Graph Theory; Extremal Graph Theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yager, D. J. D. (2019). Sufficient degree conditions for graph embeddings. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105617

Chicago Manual of Style (16^{th} Edition):

Yager, Derrek Jordan Dinius. “Sufficient degree conditions for graph embeddings.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/105617.

MLA Handbook (7^{th} Edition):

Yager, Derrek Jordan Dinius. “Sufficient degree conditions for graph embeddings.” 2019. Web. 16 Jul 2020.

Vancouver:

Yager DJD. Sufficient degree conditions for graph embeddings. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/105617.

Council of Science Editors:

Yager DJD. Sufficient degree conditions for graph embeddings. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105617

4. Bernshteyn, Anton. Coloring problems in combinatorics and descriptive set theory.

Degree: PhD, Mathematics, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/101454

► In this dissertation we study problems related to colorings of combinatorial structures both in the “classical” finite context and in the framework of descriptive set…
(more)

Subjects/Keywords: coloring; probabilistic method; Lovasz Local Lemma; graphs; hypergraphs; list coloring; DP-coloring; descriptive combinatorics; measurable dynamics; generic dynamics; symbolic dynamics; weak containment

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bernshteyn, A. (2018). Coloring problems in combinatorics and descriptive set theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101454

Chicago Manual of Style (16^{th} Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/101454.

MLA Handbook (7^{th} Edition):

Bernshteyn, Anton. “Coloring problems in combinatorics and descriptive set theory.” 2018. Web. 16 Jul 2020.

Vancouver:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/101454.

Council of Science Editors:

Bernshteyn A. Coloring problems in combinatorics and descriptive set theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101454

5. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97669

► This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the…
(more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

Chicago Manual of Style (16^{th} Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7^{th} Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 16 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669

6. Petrickova, Sarka. Extremal problems on counting combinatorial structures.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97401

► The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In…
(more)

Subjects/Keywords: Extremal; Counting; Triangle-free; Maximal; Structure; Poset; Comparable pair; Chromatic number; Choosability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Petrickova, S. (2017). Extremal problems on counting combinatorial structures. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97401

Chicago Manual of Style (16^{th} Edition):

Petrickova, Sarka. “Extremal problems on counting combinatorial structures.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/97401.

MLA Handbook (7^{th} Edition):

Petrickova, Sarka. “Extremal problems on counting combinatorial structures.” 2017. Web. 16 Jul 2020.

Vancouver:

Petrickova S. Extremal problems on counting combinatorial structures. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/97401.

Council of Science Editors:

Petrickova S. Extremal problems on counting combinatorial structures. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97401

7. Luo, Ruth. Extremal problems for cycles in graphs and hypergraphs.

Degree: PhD, Mathematics, 2019, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/105633

► In this thesis, we study several generalizations of Turan type problems in graphs and hypergraphs. In particular, we focus on graphs and hypergraphs without long…
(more)

Subjects/Keywords: cycles; paths; Berge cycles; Berge paths; Turan problems; hypergraphs; extremal combinatorics; graph theory; hypergraph theory

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Luo, R. (2019). Extremal problems for cycles in graphs and hypergraphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105633

Chicago Manual of Style (16^{th} Edition):

Luo, Ruth. “Extremal problems for cycles in graphs and hypergraphs.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/105633.

MLA Handbook (7^{th} Edition):

Luo, Ruth. “Extremal problems for cycles in graphs and hypergraphs.” 2019. Web. 16 Jul 2020.

Vancouver:

Luo R. Extremal problems for cycles in graphs and hypergraphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/105633.

Council of Science Editors:

Luo R. Extremal problems for cycles in graphs and hypergraphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105633

8. Yeager, Elyse Christine. Extremal problems in disjoint cycles and graph saturation.

Degree: PhD, Mathematics, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/78444

► In this thesis, we tackle two main themes: sufficient conditions for the existence of particular subgraphs in a graph, and variations on graph saturation. Determining…
(more)

Subjects/Keywords: equitable coloring; cycles; Corradi-Hajnal; Hajnal-Szemeredi; Chen-Lih-Wu; graph saturation; co-criticality; edge-colored saturation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yeager, E. C. (2015). Extremal problems in disjoint cycles and graph saturation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78444

Chicago Manual of Style (16^{th} Edition):

Yeager, Elyse Christine. “Extremal problems in disjoint cycles and graph saturation.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/78444.

MLA Handbook (7^{th} Edition):

Yeager, Elyse Christine. “Extremal problems in disjoint cycles and graph saturation.” 2015. Web. 16 Jul 2020.

Vancouver:

Yeager EC. Extremal problems in disjoint cycles and graph saturation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/78444.

Council of Science Editors:

Yeager EC. Extremal problems in disjoint cycles and graph saturation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78444

9. Yancey, Matthew. Sparse color-critical graphs and rainbow matchings in edge-colored graphs.

Degree: PhD, 0439, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/44365

► This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in edge-colored graphs. A graph G is k-{\em critical} if G…
(more)

Subjects/Keywords: critical graphs; coloring sparse graphs; improper graph coloring; relaxed graph coloring

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yancey, M. (2013). Sparse color-critical graphs and rainbow matchings in edge-colored graphs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44365

Chicago Manual of Style (16^{th} Edition):

Yancey, Matthew. “Sparse color-critical graphs and rainbow matchings in edge-colored graphs.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/44365.

MLA Handbook (7^{th} Edition):

Yancey, Matthew. “Sparse color-critical graphs and rainbow matchings in edge-colored graphs.” 2013. Web. 16 Jul 2020.

Vancouver:

Yancey M. Sparse color-critical graphs and rainbow matchings in edge-colored graphs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/44365.

Council of Science Editors:

Yancey M. Sparse color-critical graphs and rainbow matchings in edge-colored graphs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44365