Advanced search options

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

You searched for `subject:(Combinatorics)`

.
Showing records 1 – 30 of
683 total matches.

◁ [1] [2] [3] [4] [5] … [23] ▶

Search Limiters

Dates

- 2015 – 2019 (310)
- 2010 – 2014 (259)
- 2005 – 2009 (108)
- 2000 – 2004 (26)
- 1995 – 1999 (11)

Universities

- East Tennessee State University (48)
- University of Waterloo (38)
- University of Canterbury (33)
- University of Kentucky (21)
- University of Illinois – Urbana-Champaign (19)
- University of Oxford (19)
- ETH Zürich (17)
- Georgia Southern University (14)
- Western Kentucky University (14)
- University of Cambridge (12)
- Freie Universität Berlin (10)
- University of Victoria (10)

Department

- Mathematics (125)
- Mathematical Sciences (61)
- Informatique (24)
- Department of Mathematical Sciences (21)
- Department of Mathematics (17)
- Mathématiques (10)

Degrees

- PhD (170)
- MS (108)
- Docteur es (50)
- MSin Mathematics (M.S.) (14)

Languages

- English (375)
- French (38)
- Portuguese (19)

Country

- US (356)
- Canada (81)
- France (50)
- UK (50)
- New Zealand (36)
- Brazil (21)
- Switzerland (18)
- Australia (10)
- Germany (10)

▼ Search Limiters

University of Minnesota

1. Williams, Nathan Ferd. Cataland.

Degree: PhD, Mathematics, 2013, University of Minnesota

URL: http://purl.umn.edu/159973

► We study two combinatorial miracles relating purely poset-theoretic objects with purely Coxeter-theoretic objects. The first miracle is that there are the same number of linear…
(more)

Subjects/Keywords: Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Williams, N. F. (2013). Cataland. (Doctoral Dissertation). University of Minnesota. Retrieved from http://purl.umn.edu/159973

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

Williams, Nathan Ferd. “Cataland.” 2013. Doctoral Dissertation, University of Minnesota. Accessed December 09, 2019. http://purl.umn.edu/159973.

MLA Handbook (7^{th} Edition):

Williams, Nathan Ferd. “Cataland.” 2013. Web. 09 Dec 2019.

Vancouver:

Williams NF. Cataland. [Internet] [Doctoral dissertation]. University of Minnesota; 2013. [cited 2019 Dec 09]. Available from: http://purl.umn.edu/159973.

Council of Science Editors:

Williams NF. Cataland. [Doctoral Dissertation]. University of Minnesota; 2013. Available from: http://purl.umn.edu/159973

University of Oklahoma

2. Edwards, Craig. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.

Degree: PhD, 2019, University of Oklahoma

URL: http://hdl.handle.net/11244/319674

► Even though the problem of counting points with integer coordinates on a (rational) polytope has connections to sophisticated mathematical topics like Algebraic K-Theory, Fourier-Dedekind Sums,…
(more)

Subjects/Keywords: Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Edwards, C. (2019). THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319674

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

Edwards, Craig. “THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.” 2019. Doctoral Dissertation, University of Oklahoma. Accessed December 09, 2019. http://hdl.handle.net/11244/319674.

MLA Handbook (7^{th} Edition):

Edwards, Craig. “THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS.” 2019. Web. 09 Dec 2019.

Vancouver:

Edwards C. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2019. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/11244/319674.

Council of Science Editors:

Edwards C. THE ENUMERATION PROBLEM ON NUMERICAL MONOIDS. [Doctoral Dissertation]. University of Oklahoma; 2019. Available from: http://hdl.handle.net/11244/319674

University of Illinois – Urbana-Champaign

3.
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 December 09, 2019. 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 Dec 2019.

Vancouver:

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

Queen Mary, University of London

4.
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: Mathematical Sciences; Combinatorics; Extremal combinatorics

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 December 09, 2019. 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 Dec 2019.

Vancouver:

Day AN. A collection of problems in extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2018. [cited 2019 Dec 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

5. Morrill, Thomas. Overpartition Ranks, Cranks, and Frobenius Representations.

Degree: PhD, 2017, Oregon State University

URL: http://hdl.handle.net/1957/61616

► We generalize overpartition rank and crank generating functions to obtain k-fold variants, and give a combinatorial interpretation for each. The k-fold crank generating function is…
(more)

Subjects/Keywords: Combinatorics

…A powerful tool in *combinatorics* is the generating series, which is a power series
X
n≥0… …analytic functions of τ under these conditions. In this light, the
*combinatorics* of partitions…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Morrill, T. (2017). Overpartition Ranks, Cranks, and Frobenius Representations. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/61616

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

Morrill, Thomas. “Overpartition Ranks, Cranks, and Frobenius Representations.” 2017. Doctoral Dissertation, Oregon State University. Accessed December 09, 2019. http://hdl.handle.net/1957/61616.

MLA Handbook (7^{th} Edition):

Morrill, Thomas. “Overpartition Ranks, Cranks, and Frobenius Representations.” 2017. Web. 09 Dec 2019.

Vancouver:

Morrill T. Overpartition Ranks, Cranks, and Frobenius Representations. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1957/61616.

Council of Science Editors:

Morrill T. Overpartition Ranks, Cranks, and Frobenius Representations. [Doctoral Dissertation]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61616

University of Waterloo

6. Chan, Kelvin Tian Yi. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.

Degree: 2018, University of Waterloo

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

► Transitive factorizations faithfully encode many interesting objects. The well-known ones include ramified coverings of the sphere and hypermaps. Enumeration of specific classes of such objects…
(more)

Subjects/Keywords: Algebraic Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chan, K. T. Y. (2018). Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13601

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):

Chan, Kelvin Tian Yi. “Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.” 2018. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/13601.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chan, Kelvin Tian Yi. “Induction Relations in the Symmetric Groups and Jucys-Murphy Elements.” 2018. Web. 09 Dec 2019.

Vancouver:

Chan KTY. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/13601.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan KTY. Induction Relations in the Symmetric Groups and Jucys-Murphy Elements. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13601

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

7.
Scheinerman, Daniel, 1986-.
Several problems in linear algebraic and additive * combinatorics*.

Degree: PhD, Mathematics, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/

►

This thesis studies three problems in linear algebraic and additive *combinatorics*. Our first result gives new upper bounds for the determinant of an nimes n…
(more)

Subjects/Keywords: Additive combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Scheinerman, Daniel, 1. (2019). Several problems in linear algebraic and additive combinatorics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/61005/

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

Scheinerman, Daniel, 1986-. “Several problems in linear algebraic and additive combinatorics.” 2019. Doctoral Dissertation, Rutgers University. Accessed December 09, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/61005/.

MLA Handbook (7^{th} Edition):

Scheinerman, Daniel, 1986-. “Several problems in linear algebraic and additive combinatorics.” 2019. Web. 09 Dec 2019.

Vancouver:

Scheinerman, Daniel 1. Several problems in linear algebraic and additive combinatorics. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2019 Dec 09]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/.

Council of Science Editors:

Scheinerman, Daniel 1. Several problems in linear algebraic and additive combinatorics. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61005/

University of Oxford

8. Weller, Kerstin B. Connectivity and related properties for graph classes.

Degree: PhD, 2014, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030

► There has been much recent interest in random graphs sampled uniformly from the set of (labelled) graphs on n vertices in a suitably structured class…
(more)

Subjects/Keywords: 511; Combinatorics; Graph Theory; Analytic Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Weller, K. B. (2014). Connectivity and related properties for graph classes. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030

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

Weller, Kerstin B. “Connectivity and related properties for graph classes.” 2014. Doctoral Dissertation, University of Oxford. Accessed December 09, 2019. http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030.

MLA Handbook (7^{th} Edition):

Weller, Kerstin B. “Connectivity and related properties for graph classes.” 2014. Web. 09 Dec 2019.

Vancouver:

Weller KB. Connectivity and related properties for graph classes. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Dec 09]. Available from: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030.

Council of Science Editors:

Weller KB. Connectivity and related properties for graph classes. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:667a139e-6d2c-4f67-8487-04c3a0136226 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596030

University of Cambridge

9. Przykucki, Michał Jan. Extremal and probabilistic bootstrap percolation .

Degree: 2013, University of Cambridge

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

► 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 . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/245349

Not specified: Masters Thesis or Doctoral Dissertation

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

Przykucki, Michał Jan. “Extremal and probabilistic bootstrap percolation .” 2013. Thesis, University of Cambridge. Accessed December 09, 2019. https://www.repository.cam.ac.uk/handle/1810/245349.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

Przykucki MJ. Extremal and probabilistic bootstrap percolation . [Internet] [Thesis]. University of Cambridge; 2013. [cited 2019 Dec 09]. Available from: https://www.repository.cam.ac.uk/handle/1810/245349.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Przykucki MJ. Extremal and probabilistic bootstrap percolation . [Thesis]. University of Cambridge; 2013. Available from: https://www.repository.cam.ac.uk/handle/1810/245349

Not specified: Masters Thesis or Doctoral Dissertation

University of Guelph

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

Degree: 2012, University of Guelph

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

► Given two set systems \mathscr{A} and ℬ over an n-element set, we say that (\mathscr{A,B}) forms a recovering pair if the following conditions hold: \…
(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 . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/4926

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

11. Erickson, Sarah A. Listing as a Potential Connection between Sets of Outcomes and Counting Processes.

Degree: MS, Mathematics, 2015, Oregon State University

URL: http://hdl.handle.net/1957/57952

► Counting problems are rich in opportunities for students to make meaningful mathematical connections and develop non-algorithmic thinking; their accessible nature and applications to computer science…
(more)

Subjects/Keywords: combinatorics; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Erickson, S. A. (2015). Listing as a Potential Connection between Sets of Outcomes and Counting Processes. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/57952

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

Erickson, Sarah A. “Listing as a Potential Connection between Sets of Outcomes and Counting Processes.” 2015. Masters Thesis, Oregon State University. Accessed December 09, 2019. http://hdl.handle.net/1957/57952.

MLA Handbook (7^{th} Edition):

Erickson, Sarah A. “Listing as a Potential Connection between Sets of Outcomes and Counting Processes.” 2015. Web. 09 Dec 2019.

Vancouver:

Erickson SA. Listing as a Potential Connection between Sets of Outcomes and Counting Processes. [Internet] [Masters thesis]. Oregon State University; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1957/57952.

Council of Science Editors:

Erickson SA. Listing as a Potential Connection between Sets of Outcomes and Counting Processes. [Masters Thesis]. Oregon State University; 2015. Available from: http://hdl.handle.net/1957/57952

University of Toronto

12. Li, Xiang. On the Logarithimic Calculus and Sidorenko's Conjecture.

Degree: 2011, University of Toronto

URL: http://hdl.handle.net/1807/31311

►

We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration… (more)

Subjects/Keywords: Combinatorics; Probability; 0280

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, X. (2011). On the Logarithimic Calculus and Sidorenko's Conjecture. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31311

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

Li, Xiang. “On the Logarithimic Calculus and Sidorenko's Conjecture.” 2011. Masters Thesis, University of Toronto. Accessed December 09, 2019. http://hdl.handle.net/1807/31311.

MLA Handbook (7^{th} Edition):

Li, Xiang. “On the Logarithimic Calculus and Sidorenko's Conjecture.” 2011. Web. 09 Dec 2019.

Vancouver:

Li X. On the Logarithimic Calculus and Sidorenko's Conjecture. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1807/31311.

Council of Science Editors:

Li X. On the Logarithimic Calculus and Sidorenko's Conjecture. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31311

University of Waterloo

13. Nelson, Peter. Exponentially Dense Matroids.

Degree: 2011, University of Waterloo

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

► This thesis deals with questions relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that…
(more)

Subjects/Keywords: Matroid; Mathematics; Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nelson, P. (2011). Exponentially Dense Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6399

Not specified: Masters Thesis or Doctoral Dissertation

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

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/6399.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Web. 09 Dec 2019.

Vancouver:

Nelson P. Exponentially Dense Matroids. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/6399.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nelson P. Exponentially Dense Matroids. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6399

Not specified: Masters Thesis or Doctoral Dissertation

Queen Mary, University of London

14. Pinto, Trevor Alvaro Anthony. Extremal problems on the hypercube.

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

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

► The hypercube, Qd, is a natural and much studied combinatorial object, and we discuss various extremal problems related to it. A subgraph of the hypercube…
(more)

Subjects/Keywords: Combinatorics; Mathematical Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pinto, T. A. A. (2016). Extremal problems on the hypercube. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812

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

Pinto, Trevor Alvaro Anthony. “Extremal problems on the hypercube.” 2016. Doctoral Dissertation, Queen Mary, University of London. Accessed December 09, 2019. http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812.

MLA Handbook (7^{th} Edition):

Pinto, Trevor Alvaro Anthony. “Extremal problems on the hypercube.” 2016. Web. 09 Dec 2019.

Vancouver:

Pinto TAA. Extremal problems on the hypercube. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2016. [cited 2019 Dec 09]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812.

Council of Science Editors:

Pinto TAA. Extremal problems on the hypercube. [Doctoral Dissertation]. Queen Mary, University of London; 2016. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.765812

Queen Mary, University of London

15.
Bartley, Jack Patrick.
Topics in extremal and probabilistic * combinatorics*.

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

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

► In this thesis, we consider a collection of problems in extremal and probabilistic *combinatorics*, specifically graph theory. First, we consider a close relative of the…
(more)

Subjects/Keywords: Combinatorics; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bartley, J. P. (2018). Topics in extremal and probabilistic combinatorics. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/56858 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.786410

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

Bartley, Jack Patrick. “Topics in extremal and probabilistic combinatorics.” 2018. Doctoral Dissertation, Queen Mary, University of London. Accessed December 09, 2019. http://qmro.qmul.ac.uk/xmlui/handle/123456789/56858 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.786410.

MLA Handbook (7^{th} Edition):

Bartley, Jack Patrick. “Topics in extremal and probabilistic combinatorics.” 2018. Web. 09 Dec 2019.

Vancouver:

Bartley JP. Topics in extremal and probabilistic combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2018. [cited 2019 Dec 09]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/56858 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.786410.

Council of Science Editors:

Bartley JP. Topics in extremal and probabilistic combinatorics. [Doctoral Dissertation]. Queen Mary, University of London; 2018. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/56858 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.786410

Colorado State University

16. Cooper, Benjamin C. Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals.

Degree: PhD, Mathematics, 2015, Colorado State University

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

► A hyperoval is a (q+2)- arc of a projective plane π, of order q with q even. Let G denote the collineation group of π…
(more)

Subjects/Keywords: finite geometry; combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cooper, B. C. (2015). Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/167107

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

Cooper, Benjamin C. “Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals.” 2015. Doctoral Dissertation, Colorado State University. Accessed December 09, 2019. http://hdl.handle.net/10217/167107.

MLA Handbook (7^{th} Edition):

Cooper, Benjamin C. “Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals.” 2015. Web. 09 Dec 2019.

Vancouver:

Cooper BC. Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals. [Internet] [Doctoral dissertation]. Colorado State University; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10217/167107.

Council of Science Editors:

Cooper BC. Abstract Hyperovals, Partial Geometries, and Transitive Hyperovals. [Doctoral Dissertation]. Colorado State University; 2015. Available from: http://hdl.handle.net/10217/167107

University of Cambridge

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

Degree: 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 . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/273375

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Queen Mary, University of London

18.
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 December 09, 2019. 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 Dec 2019.

Vancouver:

Falgas-Ravry V. Thresholds in probabilistic and extremal combinatorics. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2012. [cited 2019 Dec 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 Cambridge

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

Degree: PhD, 2018, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/278254 ; 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: 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://www.repository.cam.ac.uk/handle/1810/278254 ; 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 December 09, 2019. https://www.repository.cam.ac.uk/handle/1810/278254 ; 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 Dec 2019.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2019 Dec 09]. Available from: https://www.repository.cam.ac.uk/handle/1810/278254 ; 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://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

University of Rochester

20.
Murphy, Brendan; Iosevich, Alex (1967 - ).
Group actions in arithmetic * combinatorics*.

Degree: PhD, 2017, University of Rochester

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

► The *subject* of this dissertation is approximate group actions. This *subject* is a synthesis of arithmetic *combinatorics*, which is the study of subsets of commutative…
(more)

Subjects/Keywords: Additive combinatorics; Approximate group theory; Combinatorics; Geometric combinatorics; Group action; Sum-product problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Murphy, Brendan; Iosevich, A. (. -. ). (2017). Group actions in arithmetic combinatorics. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/31885

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

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Doctoral Dissertation, University of Rochester. Accessed December 09, 2019. http://hdl.handle.net/1802/31885.

MLA Handbook (7^{th} Edition):

Murphy, Brendan; Iosevich, Alex (1967 - ). “Group actions in arithmetic combinatorics.” 2017. Web. 09 Dec 2019.

Vancouver:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1802/31885.

Council of Science Editors:

Murphy, Brendan; Iosevich A(-). Group actions in arithmetic combinatorics. [Doctoral Dissertation]. University of Rochester; 2017. Available from: http://hdl.handle.net/1802/31885

Dalhousie University

21. Cox, Danielle. On Network Reliability.

Degree: PhD, Department of Mathematics & Statistics - Math Division, 2013, Dalhousie University

URL: http://hdl.handle.net/10222/27775

► The all terminal reliability of a graph G is the probability that at least a spanning tree is operational, given that vertices are always operational…
(more)

Subjects/Keywords: Polynomials; Combinatorics; Network reliability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cox, D. (2013). On Network Reliability. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/27775

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

Cox, Danielle. “On Network Reliability.” 2013. Doctoral Dissertation, Dalhousie University. Accessed December 09, 2019. http://hdl.handle.net/10222/27775.

MLA Handbook (7^{th} Edition):

Cox, Danielle. “On Network Reliability.” 2013. Web. 09 Dec 2019.

Vancouver:

Cox D. On Network Reliability. [Internet] [Doctoral dissertation]. Dalhousie University; 2013. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10222/27775.

Council of Science Editors:

Cox D. On Network Reliability. [Doctoral Dissertation]. Dalhousie University; 2013. Available from: http://hdl.handle.net/10222/27775

Temple University

22. Dobbins, Michael Gene. Representations of Polytopes.

Degree: PhD, 2011, Temple University

URL: http://digital.library.temple.edu/u?/p245801coll10,141523

►

Mathematics

Here we investigate a variety of ways to represent polytopes and related objects. We define a class of posets, which includes all abstract polytopes,… (more)

Subjects/Keywords: Mathematics; Combinatorics; Discrete Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dobbins, M. G. (2011). Representations of Polytopes. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,141523

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

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Doctoral Dissertation, Temple University. Accessed December 09, 2019. http://digital.library.temple.edu/u?/p245801coll10,141523.

MLA Handbook (7^{th} Edition):

Dobbins, Michael Gene. “Representations of Polytopes.” 2011. Web. 09 Dec 2019.

Vancouver:

Dobbins MG. Representations of Polytopes. [Internet] [Doctoral dissertation]. Temple University; 2011. [cited 2019 Dec 09]. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523.

Council of Science Editors:

Dobbins MG. Representations of Polytopes. [Doctoral Dissertation]. Temple University; 2011. Available from: http://digital.library.temple.edu/u?/p245801coll10,141523

Texas A&M University

23. Kostic, Dimitrije Nenad. Graph searching and a generalized parking function.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1549

► Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these…
(more)

Subjects/Keywords: combinatorics; parking functions; algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kostic, D. N. (2009). Graph searching and a generalized parking function. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1549

Not specified: Masters Thesis or Doctoral Dissertation

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

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Thesis, Texas A&M University. Accessed December 09, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1549.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Web. 09 Dec 2019.

Vancouver:

Kostic DN. Graph searching and a generalized parking function. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kostic DN. Graph searching and a generalized parking function. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

24. Prideaux, Kadin. Matroids, Cyclic Flats, and Polyhedra.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5204

► Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are…
(more)

Subjects/Keywords: Matroid theory; Discrete geometry; Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Prideaux, K. (2016). Matroids, Cyclic Flats, and Polyhedra. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5204

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

Prideaux, Kadin. “Matroids, Cyclic Flats, and Polyhedra.” 2016. Masters Thesis, Victoria University of Wellington. Accessed December 09, 2019. http://hdl.handle.net/10063/5204.

MLA Handbook (7^{th} Edition):

Prideaux, Kadin. “Matroids, Cyclic Flats, and Polyhedra.” 2016. Web. 09 Dec 2019.

Vancouver:

Prideaux K. Matroids, Cyclic Flats, and Polyhedra. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10063/5204.

Council of Science Editors:

Prideaux K. Matroids, Cyclic Flats, and Polyhedra. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5204

University of Oxford

25. Fountoulakis, N. Thresholds and the structure of sparse random graphs.

Degree: 2003, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:78ad42fb-5b71-4133-8be0-4ffb919e0e95 : http://eprints.maths.ox.ac.uk/50/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275502

► In this thesis, we obtain approximations to the non-3-colourability threshold of sparse random graphs and we investigate the structure of random graphs near the region…
(more)

Subjects/Keywords: 511; Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fountoulakis, N. (2003). Thresholds and the structure of sparse random graphs. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:78ad42fb-5b71-4133-8be0-4ffb919e0e95 : http://eprints.maths.ox.ac.uk/50/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275502

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

Fountoulakis, N. “Thresholds and the structure of sparse random graphs.” 2003. Doctoral Dissertation, University of Oxford. Accessed December 09, 2019. http://ora.ox.ac.uk/objects/uuid:78ad42fb-5b71-4133-8be0-4ffb919e0e95 : http://eprints.maths.ox.ac.uk/50/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275502.

MLA Handbook (7^{th} Edition):

Fountoulakis, N. “Thresholds and the structure of sparse random graphs.” 2003. Web. 09 Dec 2019.

Vancouver:

Fountoulakis N. Thresholds and the structure of sparse random graphs. [Internet] [Doctoral dissertation]. University of Oxford; 2003. [cited 2019 Dec 09]. Available from: http://ora.ox.ac.uk/objects/uuid:78ad42fb-5b71-4133-8be0-4ffb919e0e95 : http://eprints.maths.ox.ac.uk/50/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275502.

Council of Science Editors:

Fountoulakis N. Thresholds and the structure of sparse random graphs. [Doctoral Dissertation]. University of Oxford; 2003. Available from: http://ora.ox.ac.uk/objects/uuid:78ad42fb-5b71-4133-8be0-4ffb919e0e95 : http://eprints.maths.ox.ac.uk/50/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275502

The Ohio State University

26. Lennon, Craig. On the likely number of stable marriages.

Degree: PhD, Mathematics, 2007, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095

► An instance of a size n - stable marriage problem involves n men and n women, each individually ranking all members of opposite sex in…
(more)

Subjects/Keywords: Mathematics; Stable marriage; Probability; Combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lennon, C. (2007). On the likely number of stable marriages. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095

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

Lennon, Craig. “On the likely number of stable marriages.” 2007. Doctoral Dissertation, The Ohio State University. Accessed December 09, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095.

MLA Handbook (7^{th} Edition):

Lennon, Craig. “On the likely number of stable marriages.” 2007. Web. 09 Dec 2019.

Vancouver:

Lennon C. On the likely number of stable marriages. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2019 Dec 09]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095.

Council of Science Editors:

Lennon C. On the likely number of stable marriages. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1194991095

California State Polytechnic University – Pomona

27. Mendez, Omar. Equal labelings for P^K sided dice.

Degree: Mathematics and Statistics Department, 2015, California State Polytechnic University – Pomona

URL: http://hdl.handle.net/10211.3/145886

► For m n-sided dice we call the possible sums m, m+1, m+2, ..., mn the standard sums. We wish to relabel m n-sided dice in…
(more)

Subjects/Keywords: algebra; number theory; combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mendez, O. (2015). Equal labelings for P^K sided dice. (Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/145886

Not specified: Masters Thesis or Doctoral Dissertation

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

Mendez, Omar. “Equal labelings for P^K sided dice.” 2015. Thesis, California State Polytechnic University – Pomona. Accessed December 09, 2019. http://hdl.handle.net/10211.3/145886.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mendez, Omar. “Equal labelings for P^K sided dice.” 2015. Web. 09 Dec 2019.

Vancouver:

Mendez O. Equal labelings for P^K sided dice. [Internet] [Thesis]. California State Polytechnic University – Pomona; 2015. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10211.3/145886.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mendez O. Equal labelings for P^K sided dice. [Thesis]. California State Polytechnic University – Pomona; 2015. Available from: http://hdl.handle.net/10211.3/145886

Not specified: Masters Thesis or Doctoral Dissertation

University of Tasmania

28. Ham, NC. The planar modular partition monoid.

Degree: 2016, University of Tasmania

URL: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

► The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters m, k ∈ Z>0, which has simultaneously…
(more)

Subjects/Keywords: Algebra; Combinatorics; Discrete Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ham, N. (2016). The planar modular partition monoid. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Ham, NC. “The planar modular partition monoid.” 2016. Thesis, University of Tasmania. Accessed December 09, 2019. https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ham, NC. “The planar modular partition monoid.” 2016. Web. 09 Dec 2019.

Vancouver:

Ham N. The planar modular partition monoid. [Internet] [Thesis]. University of Tasmania; 2016. [cited 2019 Dec 09]. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ham N. The planar modular partition monoid. [Thesis]. University of Tasmania; 2016. Available from: https://eprints.utas.edu.au/23029/1/Ham_whole_thesis.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

29. Snider, Michelle. Affine Patches On Positroid Varieties And Affine Pipe Dreams .

Degree: 2011, Cornell University

URL: http://hdl.handle.net/1813/33472

► The objects of interest in this thesis are positroid varieties in the Grassmannian, which are indexed by juggling patterns. In particular, we study affine patches…
(more)

Subjects/Keywords: algebraic combinatorics; algebraic geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Snider, M. (2011). Affine Patches On Positroid Varieties And Affine Pipe Dreams . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/33472

Not specified: Masters Thesis or Doctoral Dissertation

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

Snider, Michelle. “Affine Patches On Positroid Varieties And Affine Pipe Dreams .” 2011. Thesis, Cornell University. Accessed December 09, 2019. http://hdl.handle.net/1813/33472.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Snider, Michelle. “Affine Patches On Positroid Varieties And Affine Pipe Dreams .” 2011. Web. 09 Dec 2019.

Vancouver:

Snider M. Affine Patches On Positroid Varieties And Affine Pipe Dreams . [Internet] [Thesis]. Cornell University; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1813/33472.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Snider M. Affine Patches On Positroid Varieties And Affine Pipe Dreams . [Thesis]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/33472

Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

30. Taylor, Jesse. Selected Problems on Matroid Minors.

Degree: PhD, Applied Mathematics, 2014, Louisiana State University

URL: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95

► This dissertation begins with an introduction to matroids and graphs. In the first chapter, we develop matroid and graph theory definitions and preliminary results sufficient…
(more)

Subjects/Keywords: graphs; minors; combinatorics; matroids

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taylor, J. (2014). Selected Problems on Matroid Minors. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95

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

Taylor, Jesse. “Selected Problems on Matroid Minors.” 2014. Doctoral Dissertation, Louisiana State University. Accessed December 09, 2019. etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95.

MLA Handbook (7^{th} Edition):

Taylor, Jesse. “Selected Problems on Matroid Minors.” 2014. Web. 09 Dec 2019.

Vancouver:

Taylor J. Selected Problems on Matroid Minors. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2019 Dec 09]. Available from: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95.

Council of Science Editors:

Taylor J. Selected Problems on Matroid Minors. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07042014-133808 ; https://digitalcommons.lsu.edu/gradschool_dissertations/95