Advanced search options

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

You searched for `subject:(Extremal combinatorics)`

.
Showing records 1 – 30 of
54 total matches.

Search Limiters

Dates

- 2017 – 2021 (25)
- 2012 – 2016 (22)
- 2007 – 2011 (10)

▼ 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 March 09, 2021. 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. 09 Mar 2021.

Vancouver:

Wagner ZA. On some problems in extremal, probabilistic and enumerative combinatorics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 09]. 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 Guelph

2. Styner, Dustin. A Collection of Results of Simonyi's Conjecture.

Degree: MS, Department of Mathematics and Statistics, 2012, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926

► ℬ| ≤ 2^{n}. This conjecture is the focus of this thesis. This thesis contains a collection of proofs of special cases that together form a complete…
(more)

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Styner, D. (2012). A Collection of Results of Simonyi's Conjecture. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926

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

Styner, Dustin. “A Collection of Results of Simonyi's Conjecture.” 2012. Masters Thesis, University of Guelph. Accessed March 09, 2021. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926.

MLA Handbook (7^{th} Edition):

Styner, Dustin. “A Collection of Results of Simonyi's Conjecture.” 2012. Web. 09 Mar 2021.

Vancouver:

Styner D. A Collection of Results of Simonyi's Conjecture. [Internet] [Masters thesis]. University of Guelph; 2012. [cited 2021 Mar 09]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926.

Council of Science Editors:

Styner D. A Collection of Results of Simonyi's Conjecture. [Masters Thesis]. University of Guelph; 2012. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926

University of Cambridge

3.
Przykucki, Michał Jan.
* Extremal* and probabilistic bootstrap percolation.

Degree: PhD, 2013, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg

► In this dissertation we consider several *extremal* and probabilistic problems in bootstrap percolation on various families of graphs, including grids, hypercubes and trees. Bootstrap percolation…
(more)

Subjects/Keywords: Bootstrap percolation; Probabilistic combinatorics; Extremal combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Przykucki, M. J. (2013). Extremal and probabilistic bootstrap percolation. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg

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

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg.

MLA Handbook (7^{th} Edition):

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Web. 09 Mar 2021.

Vancouver:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2021 Mar 09]. Available from: https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg.

Council of Science Editors:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Doctoral Dissertation]. University of Cambridge; 2013. Available from: https://www.repository.cam.ac.uk/handle/1810/245349https://www.repository.cam.ac.uk/bitstream/1810/245349/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/5/thesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/245349/6/thesis.pdf.jpg

University of Cambridge

4.
Milicevic, Luka.
Topics in metric geometry, combinatorial geometry, *extremal* *combinatorics* and additive * combinatorics*.

Degree: PhD, 2018, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/273375

► In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space (X,d), a…
(more)

Subjects/Keywords: combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375

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

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://www.repository.cam.ac.uk/handle/1810/273375.

MLA Handbook (7^{th} Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Web. 09 Mar 2021.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Mar 09]. Available from: https://www.repository.cam.ac.uk/handle/1810/273375.

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/273375

Queen Mary, University of London

5.
Falgas-Ravry, Victor.
Thresholds in probabilistic and *extremal* * combinatorics*.

Degree: PhD, 2012, Queen Mary, University of London

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

► This thesis lies in the field of probabilistic and *extremal* *combinatorics*: we study discrete structures, with a focus on thresholds, when the behaviour of a…
(more)

Subjects/Keywords: 519.2; Mathematics; Combinatorics; Discrete structures; Probabilistic combinatorics; Extremal combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Falgas-Ravry, V. (2012). Thresholds in probabilistic and extremal combinatorics. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

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

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Doctoral Dissertation, Queen Mary, University of London. Accessed March 09, 2021. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

MLA Handbook (7^{th} Edition):

Falgas-Ravry, Victor. “Thresholds in probabilistic and extremal combinatorics.” 2012. Web. 09 Mar 2021.

Vancouver:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2012. [cited 2021 Mar 09]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640.

Council of Science Editors:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Doctoral Dissertation]. Queen Mary, University of London; 2012. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/8827 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.566640

University of Waterloo

6. Walsh, Zachary. Quadratically Dense Matroids.

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/16051

► This thesis is concerned with finding the maximum density of rank-n matroids in a minor-closed class. The *extremal* function of a non-empty minor-closed class \mathcal…
(more)

Subjects/Keywords: matroids; combinatorics; density; quadratic; extremal; fields

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walsh, Z. (2020). Quadratically Dense Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16051

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

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

Walsh, Zachary. “Quadratically Dense Matroids.” 2020. Thesis, University of Waterloo. Accessed March 09, 2021. http://hdl.handle.net/10012/16051.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Walsh, Zachary. “Quadratically Dense Matroids.” 2020. Web. 09 Mar 2021.

Vancouver:

Walsh Z. Quadratically Dense Matroids. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10012/16051.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walsh Z. Quadratically Dense Matroids. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16051

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

7. Lindzey, Nathan. Matchings and Representation Theory.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/14267

► In this thesis we investigate the algebraic properties of matchings via representation theory. We identify three scenarios in different areas of combinatorial mathematics where the…
(more)

Subjects/Keywords: Representation Theory; Extremal Combinatorics; Symmetric Functions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lindzey, N. (2018). Matchings and Representation Theory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14267

Not specified: Masters Thesis or Doctoral Dissertation

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

Lindzey, Nathan. “Matchings and Representation Theory.” 2018. Thesis, University of Waterloo. Accessed March 09, 2021. http://hdl.handle.net/10012/14267.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lindzey, Nathan. “Matchings and Representation Theory.” 2018. Web. 09 Mar 2021.

Vancouver:

Lindzey N. Matchings and Representation Theory. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10012/14267.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lindzey N. Matchings and Representation Theory. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/14267

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

8. Blumenthal, Adam. Domination problems in directed graphs and inducibility of nets.

Degree: 2020, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17952

► In this thesis we discuss two topics: domination parameters and inducibility. In the first chapter, we introduce basic concepts, definitions, and a brief history for…
(more)

Subjects/Keywords: Directed Graphs; Domination; Extremal Combinatorics; Graphs; Inducibility

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blumenthal, A. (2020). Domination problems in directed graphs and inducibility of nets. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17952

Not specified: Masters Thesis or Doctoral Dissertation

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

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Thesis, Iowa State University. Accessed March 09, 2021. https://lib.dr.iastate.edu/etd/17952.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Blumenthal, Adam. “Domination problems in directed graphs and inducibility of nets.” 2020. Web. 09 Mar 2021.

Vancouver:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Internet] [Thesis]. Iowa State University; 2020. [cited 2021 Mar 09]. Available from: https://lib.dr.iastate.edu/etd/17952.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Blumenthal A. Domination problems in directed graphs and inducibility of nets. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17952

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

9.
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 March 09, 2021. http://hdl.handle.net/2142/89148.

MLA Handbook (7^{th} Edition):

Liu, Hong. “Extremal graph theory: supersaturation and enumeration.” 2015. Web. 09 Mar 2021.

Vancouver:

Liu H. Extremal graph theory: supersaturation and enumeration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 09]. 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

University of South Florida

10. Theado, John. An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs.

Degree: 2019, University of South Florida

URL: https://scholarcommons.usf.edu/etd/7969

► Szemere´di’s Regularity Lemma [32, 33] is an important tool in *combinatorics*, with numerous appli- cations in combinatorial number theory, discrete geometry, *extremal* graph theory, and…
(more)

Subjects/Keywords: Density; Extremal Combinatorics; Links; Partition; Quasirandomness; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Theado, J. (2019). An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/7969

Not specified: Masters Thesis or Doctoral Dissertation

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

Theado, John. “An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs.” 2019. Thesis, University of South Florida. Accessed March 09, 2021. https://scholarcommons.usf.edu/etd/7969.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Theado, John. “An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs.” 2019. Web. 09 Mar 2021.

Vancouver:

Theado J. An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs. [Internet] [Thesis]. University of South Florida; 2019. [cited 2021 Mar 09]. Available from: https://scholarcommons.usf.edu/etd/7969.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Theado J. An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs. [Thesis]. University of South Florida; 2019. Available from: https://scholarcommons.usf.edu/etd/7969

Not specified: Masters Thesis or Doctoral Dissertation

University of Cambridge

11.
David, Stefan.
*Extremal**combinatorics* and universal algorithms.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

► In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, *combinatorics* of partially ordered sets and *extremal* *combinatorics*. Firstly, we…
(more)

Subjects/Keywords: 511; Combinatorics; Extremal Combinatorics; Algorithms; Automata theory; Bootstrap percolation; Combinatorics of partially ordered sets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

David, S. (2018). Extremal combinatorics and universal algorithms. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

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

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

MLA Handbook (7^{th} Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Web. 09 Mar 2021.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Mar 09]. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

Council of Science Editors:

David S. Extremal combinatorics and universal algorithms. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.25601 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Colorado State University

12.
Lindzey, Nathan.
Towards a general theory of Erdős-Ko-Rado * combinatorics*.

Degree: MS(M.S.), Mathematics, 2014, Colorado State University

URL: http://hdl.handle.net/10217/83990

► In 1961, Erdős, Ko, and Rado proved that for a universe of size n ≥ 2k a family of k-subsets whose members pairwise intersect cannot…
(more)

Subjects/Keywords: algebraic combinatorics; extremal combinatorics; Erdős-Ko-Rado theorems; association schemes; algebraic graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lindzey, N. (2014). Towards a general theory of Erdős-Ko-Rado combinatorics. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/83990

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

Lindzey, Nathan. “Towards a general theory of Erdős-Ko-Rado combinatorics.” 2014. Masters Thesis, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/83990.

MLA Handbook (7^{th} Edition):

Lindzey, Nathan. “Towards a general theory of Erdős-Ko-Rado combinatorics.” 2014. Web. 09 Mar 2021.

Vancouver:

Lindzey N. Towards a general theory of Erdős-Ko-Rado combinatorics. [Internet] [Masters thesis]. Colorado State University; 2014. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/83990.

Council of Science Editors:

Lindzey N. Towards a general theory of Erdős-Ko-Rado combinatorics. [Masters Thesis]. Colorado State University; 2014. Available from: http://hdl.handle.net/10217/83990

University of Rochester

13. Ethier, Dillon (1988 - ). Sum-product estimates and finite point configurations over p-adic fields.

Degree: PhD, 2017, University of Rochester

URL: http://hdl.handle.net/1802/31894

► We examine Erdös-Falconer type problems in the setting of <i>p</i>-adic numbers, and establish bounds on the size of a set <i>E</i> in Q_{p}^{d} that will…
(more)

Subjects/Keywords: Combinatorics; Extremal problems; Harmonic analysis; Local fields; Nonarchimedean; p-adic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ethier, D. (. -. ). (2017). Sum-product estimates and finite point configurations over p-adic fields. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31894

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

Ethier, Dillon (1988 - ). “Sum-product estimates and finite point configurations over p-adic fields.” 2017. Doctoral Dissertation, University of Rochester. Accessed March 09, 2021. http://hdl.handle.net/1802/31894.

MLA Handbook (7^{th} Edition):

Ethier, Dillon (1988 - ). “Sum-product estimates and finite point configurations over p-adic fields.” 2017. Web. 09 Mar 2021.

Vancouver:

Ethier D(-). Sum-product estimates and finite point configurations over p-adic fields. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1802/31894.

Council of Science Editors:

Ethier D(-). Sum-product estimates and finite point configurations over p-adic fields. [Doctoral Dissertation]. University of Rochester; 2017. Available from: http://hdl.handle.net/1802/31894

University of Illinois – Chicago

14.
Terry, Caroline.
Model Theory and *Extremal* *Combinatorics*: Structure, Enumeration, and 0-1 Laws.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21323

► This thesis investigates connections between model theory and *extremal* *combinatorics*. The first part of the thesis consists of an analysis of discrete metric spaces and…
(more)

Subjects/Keywords: model theory; extremal combinatorics; Ramsey theory; zero-one laws; enumeration

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Terry, C. (2016). Model Theory and Extremal Combinatorics: Structure, Enumeration, and 0-1 Laws. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21323

Not specified: Masters Thesis or Doctoral Dissertation

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

Terry, Caroline. “Model Theory and Extremal Combinatorics: Structure, Enumeration, and 0-1 Laws.” 2016. Thesis, University of Illinois – Chicago. Accessed March 09, 2021. http://hdl.handle.net/10027/21323.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Terry, Caroline. “Model Theory and Extremal Combinatorics: Structure, Enumeration, and 0-1 Laws.” 2016. Web. 09 Mar 2021.

Vancouver:

Terry C. Model Theory and Extremal Combinatorics: Structure, Enumeration, and 0-1 Laws. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10027/21323.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Terry C. Model Theory and Extremal Combinatorics: Structure, Enumeration, and 0-1 Laws. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21323

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Chicago

15.
Wang, Lujia.
Problems in *Extremal* and Probabilistic * Combinatorics*.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22982

► We study the following four problems in *extremal* and probabilistic *combinatorics*: 1. A sunflower is a collection of distinct sets such that the intersection of…
(more)

Subjects/Keywords: Combinatorics; Extremal set theory; Probabilistic methods; Random set systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, L. (2018). Problems in Extremal and Probabilistic Combinatorics. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22982

Not specified: Masters Thesis or Doctoral Dissertation

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

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Thesis, University of Illinois – Chicago. Accessed March 09, 2021. http://hdl.handle.net/10027/22982.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Web. 09 Mar 2021.

Vancouver:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10027/22982.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22982

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Chicago

16.
Cameron, Alexander M.
* Extremal* Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/23148

► Let a 2 to 1 directed hypergraph be a 3-uniform hypergraph where every edge has two tail vertices and one head vertex. For any such…
(more)

Subjects/Keywords: combinatorics; graph theory; hypergraphs; extremal problems; directed hypergraphs; Ramsey's theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cameron, A. M. (2018). Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23148

Not specified: Masters Thesis or Doctoral Dissertation

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

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Thesis, University of Illinois – Chicago. Accessed March 09, 2021. http://hdl.handle.net/10027/23148.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Web. 09 Mar 2021.

Vancouver:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10027/23148.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/23148

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

17. Johnston, Jeremy Travis. Turán Problems on Non-uniform Hypergraphs.

Degree: PhD, Mathematics, 2014, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/2580

► A non-uniform hypergraph H = (V, E) consists of a vertex set V and an edge set E ⊆ 2 V; the edges in…
(more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; extremal combinatorics; hypergraph jumps; Turán density

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Johnston, J. T. (2014). Turán Problems on Non-uniform Hypergraphs. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/2580

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

Johnston, Jeremy Travis. “Turán Problems on Non-uniform Hypergraphs.” 2014. Doctoral Dissertation, University of South Carolina. Accessed March 09, 2021. https://scholarcommons.sc.edu/etd/2580.

MLA Handbook (7^{th} Edition):

Johnston, Jeremy Travis. “Turán Problems on Non-uniform Hypergraphs.” 2014. Web. 09 Mar 2021.

Vancouver:

Johnston JT. Turán Problems on Non-uniform Hypergraphs. [Internet] [Doctoral dissertation]. University of South Carolina; 2014. [cited 2021 Mar 09]. Available from: https://scholarcommons.sc.edu/etd/2580.

Council of Science Editors:

Johnston JT. Turán Problems on Non-uniform Hypergraphs. [Doctoral Dissertation]. University of South Carolina; 2014. Available from: https://scholarcommons.sc.edu/etd/2580

University of Cambridge

18. Gruslys, Vytautas. Tilings and other combinatorial results.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.18291 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014

► In this dissertation we treat three tiling problems and three problems in combinatorial geometry, *extremal* graph theory and sparse Ramsey theory. We first consider tilings…
(more)

Subjects/Keywords: 511; Combinatorics; Tilings; Combinatorial Geometry; Extremal Graph Theory; Ramsey Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gruslys, V. (2018). Tilings and other combinatorial results. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.18291 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014

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

Gruslys, Vytautas. “Tilings and other combinatorial results.” 2018. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://doi.org/10.17863/CAM.18291 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014.

MLA Handbook (7^{th} Edition):

Gruslys, Vytautas. “Tilings and other combinatorial results.” 2018. Web. 09 Mar 2021.

Vancouver:

Gruslys V. Tilings and other combinatorial results. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Mar 09]. Available from: https://doi.org/10.17863/CAM.18291 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014.

Council of Science Editors:

Gruslys V. Tilings and other combinatorial results. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.18291 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745014

19.
Przykucki, Michał Jan.
* Extremal* and probabilistic bootstrap percolation.

Degree: PhD, 2013, University of Cambridge

URL: https://doi.org/10.17863/CAM.16232 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607571

► In this dissertation we consider several *extremal* and probabilistic problems in bootstrap percolation on various families of graphs, including grids, hypercubes and trees. Bootstrap percolation…
(more)

Subjects/Keywords: 519.5; Bootstrap percolation; Probabilistic combinatorics; Extremal combinatorics

…to *extremal* problems, the size of the smallest percolating sets in
[n]d was… …*extremal* result in bootstrap percolation,
as a partial answer to a question of Bollobás, was… …Chapters 1, 2 and 3 of this dissertation we contribute to this developing
family of *extremal*… …trees.
In this chapter we answer an *extremal* question posed by Bollobás, that of
bounding the…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Przykucki, M. J. (2013). Extremal and probabilistic bootstrap percolation. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.16232 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607571

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

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://doi.org/10.17863/CAM.16232 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607571.

MLA Handbook (7^{th} Edition):

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation.” 2013. Web. 09 Mar 2021.

Vancouver:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Internet] [Doctoral dissertation]. University of Cambridge; 2013. [cited 2021 Mar 09]. Available from: https://doi.org/10.17863/CAM.16232 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607571.

Council of Science Editors:

Przykucki MJ. Extremal and probabilistic bootstrap percolation. [Doctoral Dissertation]. University of Cambridge; 2013. Available from: https://doi.org/10.17863/CAM.16232 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607571

20.
Day, Alan Nicholas.
A collection of problems in *extremal* * combinatorics*.

Degree: PhD, 2018, Queen Mary, University of London

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766135

► *Extremal* *combinatorics* is concerned with how large or small a combinatorial structure can be if we insist it satis es certain properties. In this thesis…
(more)

Subjects/Keywords: 511; Mathematical Sciences; Combinatorics; Extremal combinatorics

…the
probability that A occurs.
9
1.2
Thesis Introduction
*Extremal* *combinatorics* is the… …satisfies certain conditions. One
class of objects that is central to *extremal* *combinatorics* is… …Another classical example of a problem in *extremal* *combinatorics* is the
following. Given a graph… …*extremal* *combinatorics*, each of which has its own distinct flavour.
10
1.2.1
Saturated Graphs… …example of an *extremal* problem on graphs is, what is the maximum number of edges a triangle-free…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Day, A. N. (2018). A collection of problems in extremal combinatorics. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766135

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

Day, Alan Nicholas. “A collection of problems in extremal combinatorics.” 2018. Doctoral Dissertation, Queen Mary, University of London. Accessed March 09, 2021. http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766135.

MLA Handbook (7^{th} Edition):

Day, Alan Nicholas. “A collection of problems in extremal combinatorics.” 2018. Web. 09 Mar 2021.

Vancouver:

Day AN. A collection of problems in extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2018. [cited 2021 Mar 09]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766135.

Council of Science Editors:

Day AN. A collection of problems in extremal combinatorics. [Doctoral Dissertation]. Queen Mary, University of London; 2018. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766135

UCLA

21.
Das, Shagnik.
Extensions of Classic Theorems in *Extremal* * Combinatorics*.

Degree: Mathematics, 2014, UCLA

URL: http://www.escholarship.org/uc/item/5t2532gk

► *Extremal* *combinatorics* deals with the following fundamental question: how large can a structure be without containing forbidden configurations? The structures studied are extremely flexible, allowing…
(more)

Subjects/Keywords: Mathematics; Theoretical mathematics; Combinatorics; Discrete mathematics; Extremal set theory; Graph theory; Supersaturation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Das, S. (2014). Extensions of Classic Theorems in Extremal Combinatorics. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/5t2532gk

Not specified: Masters Thesis or Doctoral Dissertation

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

Das, Shagnik. “Extensions of Classic Theorems in Extremal Combinatorics.” 2014. Thesis, UCLA. Accessed March 09, 2021. http://www.escholarship.org/uc/item/5t2532gk.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Das, Shagnik. “Extensions of Classic Theorems in Extremal Combinatorics.” 2014. Web. 09 Mar 2021.

Vancouver:

Das S. Extensions of Classic Theorems in Extremal Combinatorics. [Internet] [Thesis]. UCLA; 2014. [cited 2021 Mar 09]. Available from: http://www.escholarship.org/uc/item/5t2532gk.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Das S. Extensions of Classic Theorems in Extremal Combinatorics. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/5t2532gk

Not specified: Masters Thesis or Doctoral Dissertation

University of South Carolina

22.
Wang, Zhiyu.
Connections Between *Extremal* *Combinatorics*, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.

Degree: PhD, Mathematics, 2020, University of South Carolina

URL: https://scholarcommons.sc.edu/etd/5771

► This thesis studies some problems in *extremal* and probabilistic *combinatorics*, Ricci curvature of graphs, spectral hypergraph theory and the interplay between these areas. The…
(more)

Subjects/Keywords: Mathematics; extremal combinatorics; graph theory; probabilistic methods; Ricci curvature; spectral hypergraph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Z. (2020). Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/5771

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

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Doctoral Dissertation, University of South Carolina. Accessed March 09, 2021. https://scholarcommons.sc.edu/etd/5771.

MLA Handbook (7^{th} Edition):

Wang, Zhiyu. “Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra.” 2020. Web. 09 Mar 2021.

Vancouver:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Internet] [Doctoral dissertation]. University of South Carolina; 2020. [cited 2021 Mar 09]. Available from: https://scholarcommons.sc.edu/etd/5771.

Council of Science Editors:

Wang Z. Connections Between Extremal Combinatorics, Probabilistic Methods, Ricci Curvature of Graphs, and Linear Algebra. [Doctoral Dissertation]. University of South Carolina; 2020. Available from: https://scholarcommons.sc.edu/etd/5771

University of Vermont

23.
Martin, Jo Ryder.
* Extremal*/Saturation Numbers for Guessing Numbers of Undirected Graphs.

Degree: MS, Mathematics, 2020, University of Vermont

URL: https://scholarworks.uvm.edu/graddis/1233

► Hat guessing games—logic puzzles where a group of players must try to guess the color of their own hat—have been a fun party game…
(more)

Subjects/Keywords: Combinatorics; Extremal Graph Theory; Graph Saturation; Graph Theory; Guessing Number; Network Coding; Computer Sciences; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martin, J. R. (2020). Extremal/Saturation Numbers for Guessing Numbers of Undirected Graphs. (Thesis). University of Vermont. Retrieved from https://scholarworks.uvm.edu/graddis/1233

Not specified: Masters Thesis or Doctoral Dissertation

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

Martin, Jo Ryder. “Extremal/Saturation Numbers for Guessing Numbers of Undirected Graphs.” 2020. Thesis, University of Vermont. Accessed March 09, 2021. https://scholarworks.uvm.edu/graddis/1233.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Martin, Jo Ryder. “Extremal/Saturation Numbers for Guessing Numbers of Undirected Graphs.” 2020. Web. 09 Mar 2021.

Vancouver:

Martin JR. Extremal/Saturation Numbers for Guessing Numbers of Undirected Graphs. [Internet] [Thesis]. University of Vermont; 2020. [cited 2021 Mar 09]. Available from: https://scholarworks.uvm.edu/graddis/1233.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Martin JR. Extremal/Saturation Numbers for Guessing Numbers of Undirected Graphs. [Thesis]. University of Vermont; 2020. Available from: https://scholarworks.uvm.edu/graddis/1233

Not specified: Masters Thesis or Doctoral Dissertation

Wesleyan University

24. Davino, Rocco. On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture.

Degree: Mathematics, 2019, Wesleyan University

URL: https://wesscholar.wesleyan.edu/etd_mas_theses/234

► The Erdős-Hajnal Conjecture is a famous open problem in *extremal* graph *combinatorics* relating the omission of a subgraph to the existence of a clique…
(more)

Subjects/Keywords: logic; model theory; stability; pseudofinite; extremal graph combinatorics; Erdős; Hajnal; Erdős-Hajnal conjecture

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Davino, R. (2019). On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/234

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

Davino, Rocco. “On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture.” 2019. Masters Thesis, Wesleyan University. Accessed March 09, 2021. https://wesscholar.wesleyan.edu/etd_mas_theses/234.

MLA Handbook (7^{th} Edition):

Davino, Rocco. “On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture.” 2019. Web. 09 Mar 2021.

Vancouver:

Davino R. On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture. [Internet] [Masters thesis]. Wesleyan University; 2019. [cited 2021 Mar 09]. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/234.

Council of Science Editors:

Davino R. On a Model-Theoretic Approach to a Special Case of the Erdős-Hajnal Conjecture. [Masters Thesis]. Wesleyan University; 2019. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/234

University of South Florida

25. Dizona, Jill. On Algorithmic Fractional Packings of Hypergraphs.

Degree: 2012, University of South Florida

URL: https://scholarcommons.usf.edu/etd/4029

► Let F0 be a fixed k-uniform hypergraph, and let H be a given k-uniform hypergraph on n vertices. An F0-packing of H is a family…
(more)

Subjects/Keywords: extremal combinatorics; fractional packings; linear hypergraphs; regularity; American Studies; Arts and Humanities; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dizona, J. (2012). On Algorithmic Fractional Packings of Hypergraphs. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/4029

Not specified: Masters Thesis or Doctoral Dissertation

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

Dizona, Jill. “On Algorithmic Fractional Packings of Hypergraphs.” 2012. Thesis, University of South Florida. Accessed March 09, 2021. https://scholarcommons.usf.edu/etd/4029.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dizona, Jill. “On Algorithmic Fractional Packings of Hypergraphs.” 2012. Web. 09 Mar 2021.

Vancouver:

Dizona J. On Algorithmic Fractional Packings of Hypergraphs. [Internet] [Thesis]. University of South Florida; 2012. [cited 2021 Mar 09]. Available from: https://scholarcommons.usf.edu/etd/4029.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dizona J. On Algorithmic Fractional Packings of Hypergraphs. [Thesis]. University of South Florida; 2012. Available from: https://scholarcommons.usf.edu/etd/4029

Not specified: Masters Thesis or Doctoral Dissertation

26.
Lee, Choongbum.
Problems in *Extremal* and Probabilistic * Combinatorics*.

Degree: Mathematics, 2012, UCLA

URL: http://www.escholarship.org/uc/item/7jc7f4ft

► *Extremal* *combinatorics* can be described as a subfield of *combinatorics* that studies the maximum or minimum size of discrete structures (such as graphs, set systems,…
(more)

Subjects/Keywords: Mathematics; combinatorics; discrete mathematics; extremal combinatorics; probabilistic combinatorics

…CHAPTER 1
Introduction
*Extremal* *combinatorics* can be described as a subfield of *combinatorics*… …overview of this field.
One particular beauty of *extremal* *combinatorics* lies in its connection to… …study several problems in the fields of *extremal* and probabilistic *combinatorics*. The first… …intersection of *extremal* and probabilistic *combinatorics*.
A classical theorem of Dirac [38]… …probabilistic and
*extremal* *combinatorics*, using variance calculations or martingale concentration…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lee, C. (2012). Problems in Extremal and Probabilistic Combinatorics. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/7jc7f4ft

Not specified: Masters Thesis or Doctoral Dissertation

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

Lee, Choongbum. “Problems in Extremal and Probabilistic Combinatorics.” 2012. Thesis, UCLA. Accessed March 09, 2021. http://www.escholarship.org/uc/item/7jc7f4ft.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lee, Choongbum. “Problems in Extremal and Probabilistic Combinatorics.” 2012. Web. 09 Mar 2021.

Vancouver:

Lee C. Problems in Extremal and Probabilistic Combinatorics. [Internet] [Thesis]. UCLA; 2012. [cited 2021 Mar 09]. Available from: http://www.escholarship.org/uc/item/7jc7f4ft.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee C. Problems in Extremal and Probabilistic Combinatorics. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/7jc7f4ft

Not specified: Masters Thesis or Doctoral Dissertation

University of Cambridge

27.
Milicevic, Luka.
Topics in metric geometry, combinatorial geometry, *extremal* *combinatorics* and additive * combinatorics*.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.20403 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557

Subjects/Keywords: 516; combinatorics; graph theory; extremal combinatorics; metric geometry; combinatorial geometry; additive combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Milicevic, L. (2018). Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.20403 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557

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

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://doi.org/10.17863/CAM.20403 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557.

MLA Handbook (7^{th} Edition):

Milicevic, Luka. “Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics.” 2018. Web. 09 Mar 2021.

Vancouver:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Mar 09]. Available from: https://doi.org/10.17863/CAM.20403 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557.

Council of Science Editors:

Milicevic L. Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.20403 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744557

28.
Huang, Hao.
Various Problems in *Extremal* * Combinatorics*.

Degree: Mathematics, 2012, UCLA

URL: http://www.escholarship.org/uc/item/282049q8

► *Extremal* *combinatorics* is a central theme of discrete mathematics. It deals with the problems of finding the maximum or minimum possible cardinality of a collection…
(more)

Subjects/Keywords: Mathematics; coloring; combinatorics; extremal; hypergraph; matching; probability

…*Extremal* problems in Eulerian digraphs . . . . . . . . . . . . . . . . . . . .
68
5.1… …89
6.2.1
*Extremal* Graph Theory . . . . . . . . . . . . . . . . . . . . . . . . .
90… …x28;with P. Loh and B. Sudakov), *Combinatorics*, Probability and Computing, 21… …the *extremal* example in the Erd˝
os-Ko-Rado theorem [30] which states that for n… …and the Erd˝
os-Ko-Rado theorem. When n ≥ 4k, the conjectured *extremal* example
is x1 = n − 1…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, H. (2012). Various Problems in Extremal Combinatorics. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/282049q8

Not specified: Masters Thesis or Doctoral Dissertation

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

Huang, Hao. “Various Problems in Extremal Combinatorics.” 2012. Thesis, UCLA. Accessed March 09, 2021. http://www.escholarship.org/uc/item/282049q8.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Hao. “Various Problems in Extremal Combinatorics.” 2012. Web. 09 Mar 2021.

Vancouver:

Huang H. Various Problems in Extremal Combinatorics. [Internet] [Thesis]. UCLA; 2012. [cited 2021 Mar 09]. Available from: http://www.escholarship.org/uc/item/282049q8.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang H. Various Problems in Extremal Combinatorics. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/282049q8

Not specified: Masters Thesis or Doctoral Dissertation

29. Coregliano, Leonardo Nagami. Flag algebras and tournaments.

Degree: Mestrado, Ciência da Computação, 2015, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/ ;

►

Alexander A. Razborov (2007) developed the theory of flag algebras to compute the minimum asymptotic density of triangles in a graph as a function of… (more)

Subjects/Keywords: Álgebras de flags; Asymptotic combinatorics; Combinatória assintótica; Extremal problems; Flag algebra; Problemas extremais; Quase aleatório; Quasi-random; Torneios; Tournaments

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Coregliano, L. N. (2015). Flag algebras and tournaments. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/ ;

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

Coregliano, Leonardo Nagami. “Flag algebras and tournaments.” 2015. Masters Thesis, University of São Paulo. Accessed March 09, 2021. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/ ;.

MLA Handbook (7^{th} Edition):

Coregliano, Leonardo Nagami. “Flag algebras and tournaments.” 2015. Web. 09 Mar 2021.

Vancouver:

Coregliano LN. Flag algebras and tournaments. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2021 Mar 09]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/ ;.

Council of Science Editors:

Coregliano LN. Flag algebras and tournaments. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/ ;

Vilnius University

30. Dzindzalieta, Dainius. Tiksliosios Bernulio tikimybių nelygybės.

Degree: PhD, Mathematics, 2014, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103759-89684 ;

►

Disertacijos darbo tikslas – įrodyti universalias tiksliąsias nelygybes atsitiktinių dydžių funkcijų nukrypimo nuo vidurkio tikimybėms. Universalios nelygybės pažymi, kad jos yra tolygios pagal tam tikras… (more)

Subjects/Keywords: Nepriklausomi atsitiktiniai dydžiai; Uodegų tikimybės; Lipšico funkcijos; Martingalai; Ekstremali kombinatorika; Random variables; Tail probabilities; Martingales; Lipschitz functions; Extremal combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dzindzalieta, D. (2014). Tiksliosios Bernulio tikimybių nelygybės. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103759-89684 ;

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

Dzindzalieta, Dainius. “Tiksliosios Bernulio tikimybių nelygybės.” 2014. Doctoral Dissertation, Vilnius University. Accessed March 09, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103759-89684 ;.

MLA Handbook (7^{th} Edition):

Dzindzalieta, Dainius. “Tiksliosios Bernulio tikimybių nelygybės.” 2014. Web. 09 Mar 2021.

Vancouver:

Dzindzalieta D. Tiksliosios Bernulio tikimybių nelygybės. [Internet] [Doctoral dissertation]. Vilnius University; 2014. [cited 2021 Mar 09]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103759-89684 ;.

Council of Science Editors:

Dzindzalieta D. Tiksliosios Bernulio tikimybių nelygybės. [Doctoral Dissertation]. Vilnius University; 2014. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2014~D_20140512_103759-89684 ;