Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(matroid). Showing records 1 – 30 of 71 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters


Victoria University of Wellington

1. Williams, Alan. Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis.

Degree: 2010, Victoria University of Wellington

 We show that for any 3-connected matroid M on a ground set of at least four elements such that M does not contain any 4-element… (more)

Subjects/Keywords: Matroid; Connectivity; Basis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, A. (2010). Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1630

Chicago Manual of Style (16th Edition):

Williams, Alan. “Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis.” 2010. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/1630.

MLA Handbook (7th Edition):

Williams, Alan. “Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis.” 2010. Web. 26 Jun 2019.

Vancouver:

Williams A. Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis. [Internet] [Masters thesis]. Victoria University of Wellington; 2010. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/1630.

Council of Science Editors:

Williams A. Maintaining Matroid 3-Connectivity With Respect to a Fixed Basis. [Masters Thesis]. Victoria University of Wellington; 2010. Available from: http://hdl.handle.net/10063/1630


Victoria University of Wellington

2. Clark, Ben. Tangles, Trees and Flowers.

Degree: 2011, Victoria University of Wellington

 A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ. For a connectivity function λ… (more)

Subjects/Keywords: Matroid; Connectivity; Tangles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clark, B. (2011). Tangles, Trees and Flowers. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1704

Chicago Manual of Style (16th Edition):

Clark, Ben. “Tangles, Trees and Flowers.” 2011. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/1704.

MLA Handbook (7th Edition):

Clark, Ben. “Tangles, Trees and Flowers.” 2011. Web. 26 Jun 2019.

Vancouver:

Clark B. Tangles, Trees and Flowers. [Internet] [Masters thesis]. Victoria University of Wellington; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/1704.

Council of Science Editors:

Clark B. Tangles, Trees and Flowers. [Masters Thesis]. Victoria University of Wellington; 2011. Available from: http://hdl.handle.net/10063/1704


University of Waterloo

3. Nelson, Peter. Exponentially Dense Matroids.

Degree: 2011, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nelson, Peter. “Exponentially Dense Matroids.” 2011. Web. 26 Jun 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

4. Welsh, Michael. Golden-Mean and Secret Sharing Matroids.

Degree: 2011, Victoria University of Wellington

 Maximum-sized results are an important part of matroid theory, and results currently exist for various classes of matroids. Archer conjectured that the maximum-sized golden-mean matroids… (more)

Subjects/Keywords: Matroid theory; Secret sharing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Welsh, M. (2011). Golden-Mean and Secret Sharing Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1683

Chicago Manual of Style (16th Edition):

Welsh, Michael. “Golden-Mean and Secret Sharing Matroids.” 2011. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/1683.

MLA Handbook (7th Edition):

Welsh, Michael. “Golden-Mean and Secret Sharing Matroids.” 2011. Web. 26 Jun 2019.

Vancouver:

Welsh M. Golden-Mean and Secret Sharing Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/1683.

Council of Science Editors:

Welsh M. Golden-Mean and Secret Sharing Matroids. [Masters Thesis]. Victoria University of Wellington; 2011. Available from: http://hdl.handle.net/10063/1683


Victoria University of Wellington

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

Degree: 2016, Victoria University of Wellington

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Prideaux, Kadin. “Matroids, Cyclic Flats, and Polyhedra.” 2016. Web. 26 Jun 2019.

Vancouver:

Prideaux K. Matroids, Cyclic Flats, and Polyhedra. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2019 Jun 26]. 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


Victoria University of Wellington

6. Perrott, Alexander. Identically Self-Dual Matroids.

Degree: 2017, Victoria University of Wellington

 In this thesis we focus on identically self-dual matroids and their minors. We show that every sparse paving matroid is a minor of an identically… (more)

Subjects/Keywords: Matroid; Code; Self-dual

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perrott, A. (2017). Identically Self-Dual Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6810

Chicago Manual of Style (16th Edition):

Perrott, Alexander. “Identically Self-Dual Matroids.” 2017. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/6810.

MLA Handbook (7th Edition):

Perrott, Alexander. “Identically Self-Dual Matroids.” 2017. Web. 26 Jun 2019.

Vancouver:

Perrott A. Identically Self-Dual Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/6810.

Council of Science Editors:

Perrott A. Identically Self-Dual Matroids. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/6810


Cornell University

7. Hughes, Marisa. Quotients Of Spheres By Linear Actions Of Abelian Groups .

Degree: 2013, Cornell University

 We consider quotients of spheres by linear actions of real tori and finite abelian groups. To each quotient we associate a matroid or sequence of… (more)

Subjects/Keywords: Quotient Space; Matroid; Homology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hughes, M. (2013). Quotients Of Spheres By Linear Actions Of Abelian Groups . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/33900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hughes, Marisa. “Quotients Of Spheres By Linear Actions Of Abelian Groups .” 2013. Thesis, Cornell University. Accessed June 26, 2019. http://hdl.handle.net/1813/33900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hughes, Marisa. “Quotients Of Spheres By Linear Actions Of Abelian Groups .” 2013. Web. 26 Jun 2019.

Vancouver:

Hughes M. Quotients Of Spheres By Linear Actions Of Abelian Groups . [Internet] [Thesis]. Cornell University; 2013. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1813/33900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hughes M. Quotients Of Spheres By Linear Actions Of Abelian Groups . [Thesis]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

8. Chun, Deborah. Capturing elements in matroid minors.

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

 In this dissertation, we begin with an introduction to a matroid as the natural generalization of independence arising in three different fields of mathematics. In… (more)

Subjects/Keywords: matroid; unavoidable minor; ramsey; rounded

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chun, D. (2011). Capturing elements in matroid minors. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06302011-063215 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1033

Chicago Manual of Style (16th Edition):

Chun, Deborah. “Capturing elements in matroid minors.” 2011. Doctoral Dissertation, Louisiana State University. Accessed June 26, 2019. etd-06302011-063215 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1033.

MLA Handbook (7th Edition):

Chun, Deborah. “Capturing elements in matroid minors.” 2011. Web. 26 Jun 2019.

Vancouver:

Chun D. Capturing elements in matroid minors. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2019 Jun 26]. Available from: etd-06302011-063215 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1033.

Council of Science Editors:

Chun D. Capturing elements in matroid minors. [Doctoral Dissertation]. Louisiana State University; 2011. Available from: etd-06302011-063215 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1033


Louisiana State University

9. Chun, Carolyn Barlow. Unavoidable minors in graphs and matroids.

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

 It is well known that every sufficiently large connected graph G has either a vertex of high degree or a long path. If we require… (more)

Subjects/Keywords: unavoidable; minor; matroid; graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chun, C. B. (2009). Unavoidable minors in graphs and matroids. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07092009-140417 ; https://digitalcommons.lsu.edu/gradschool_dissertations/961

Chicago Manual of Style (16th Edition):

Chun, Carolyn Barlow. “Unavoidable minors in graphs and matroids.” 2009. Doctoral Dissertation, Louisiana State University. Accessed June 26, 2019. etd-07092009-140417 ; https://digitalcommons.lsu.edu/gradschool_dissertations/961.

MLA Handbook (7th Edition):

Chun, Carolyn Barlow. “Unavoidable minors in graphs and matroids.” 2009. Web. 26 Jun 2019.

Vancouver:

Chun CB. Unavoidable minors in graphs and matroids. [Internet] [Doctoral dissertation]. Louisiana State University; 2009. [cited 2019 Jun 26]. Available from: etd-07092009-140417 ; https://digitalcommons.lsu.edu/gradschool_dissertations/961.

Council of Science Editors:

Chun CB. Unavoidable minors in graphs and matroids. [Doctoral Dissertation]. Louisiana State University; 2009. Available from: etd-07092009-140417 ; https://digitalcommons.lsu.edu/gradschool_dissertations/961


University of Waterloo

10. Christian, Robin. Infinite graphs, graph-like spaces and B-matroids.

Degree: 2011, University of Waterloo

 The central theme of this thesis is to prove results about infinite mathematical objects by studying the behaviour of their finite substructures. In particular, we… (more)

Subjects/Keywords: matroid; graph-like space

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Christian, R. (2011). Infinite graphs, graph-like spaces and B-matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5735

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Christian, Robin. “Infinite graphs, graph-like spaces and B-matroids.” 2011. Thesis, University of Waterloo. Accessed June 26, 2019. http://hdl.handle.net/10012/5735.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Christian, Robin. “Infinite graphs, graph-like spaces and B-matroids.” 2011. Web. 26 Jun 2019.

Vancouver:

Christian R. Infinite graphs, graph-like spaces and B-matroids. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10012/5735.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Christian R. Infinite graphs, graph-like spaces and B-matroids. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5735

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

11. Probert, Andrew. Chordality in Matroids: In Search of the Converse to Hliněný's Theorem.

Degree: 2018, Victoria University of Wellington

 Bodlaender et al. [7] proved a converse to Courcelle's Theorem for graphs [15] for the class of chordal graphs of bounded treewidth. Hliněný [25] generalised… (more)

Subjects/Keywords: Matroid; Chordality; Tree decomposition; MSOL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Probert, A. (2018). Chordality in Matroids: In Search of the Converse to Hliněný's Theorem. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6952

Chicago Manual of Style (16th Edition):

Probert, Andrew. “Chordality in Matroids: In Search of the Converse to Hliněný's Theorem.” 2018. Doctoral Dissertation, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/6952.

MLA Handbook (7th Edition):

Probert, Andrew. “Chordality in Matroids: In Search of the Converse to Hliněný's Theorem.” 2018. Web. 26 Jun 2019.

Vancouver:

Probert A. Chordality in Matroids: In Search of the Converse to Hliněný's Theorem. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/6952.

Council of Science Editors:

Probert A. Chordality in Matroids: In Search of the Converse to Hliněný's Theorem. [Doctoral Dissertation]. Victoria University of Wellington; 2018. Available from: http://hdl.handle.net/10063/6952


University of Waterloo

12. Wong, Chung-Yin. On the Excluded Minors for Dyadic Matroids.

Degree: 2019, University of Waterloo

 The study of the class of dyadic matroids, the matroids representable over both GF(3) and GF(5), is a natural step to finding the excluded minors… (more)

Subjects/Keywords: matroids; matroid representability; excluded minors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, C. (2019). On the Excluded Minors for Dyadic Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14367

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wong, Chung-Yin. “On the Excluded Minors for Dyadic Matroids.” 2019. Thesis, University of Waterloo. Accessed June 26, 2019. http://hdl.handle.net/10012/14367.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wong, Chung-Yin. “On the Excluded Minors for Dyadic Matroids.” 2019. Web. 26 Jun 2019.

Vancouver:

Wong C. On the Excluded Minors for Dyadic Matroids. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10012/14367.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wong C. On the Excluded Minors for Dyadic Matroids. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14367

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

13. Moss, John Tyler. Extremal Problems in Matroid Connectivity.

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

Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say that a matroid is 2-connected if and only if for… (more)

Subjects/Keywords: unavoidable minor; bicircular matroid; Bixby's Lemma; 3-connectivity; matroid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moss, J. T. (2014). Extremal Problems in Matroid Connectivity. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07052014-001609 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2234

Chicago Manual of Style (16th Edition):

Moss, John Tyler. “Extremal Problems in Matroid Connectivity.” 2014. Doctoral Dissertation, Louisiana State University. Accessed June 26, 2019. etd-07052014-001609 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2234.

MLA Handbook (7th Edition):

Moss, John Tyler. “Extremal Problems in Matroid Connectivity.” 2014. Web. 26 Jun 2019.

Vancouver:

Moss JT. Extremal Problems in Matroid Connectivity. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2019 Jun 26]. Available from: etd-07052014-001609 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2234.

Council of Science Editors:

Moss JT. Extremal Problems in Matroid Connectivity. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07052014-001609 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2234


California State University – San Bernardino

14. Garcia, Zachary. Exploring Flag Matroids and Duality.

Degree: MAin Mathematics, Mathematics, 2018, California State University – San Bernardino

  Matroids capture an abstraction of independence in mathematics, and in doing so, connect discrete mathematical structures that arise in a variety of contexts. A… (more)

Subjects/Keywords: Matroid; Flag Matroid; Duality; Gale Ordering; Other Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garcia, Z. (2018). Exploring Flag Matroids and Duality. (Thesis). California State University – San Bernardino. Retrieved from https://scholarworks.lib.csusb.edu/etd/777

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Garcia, Zachary. “Exploring Flag Matroids and Duality.” 2018. Thesis, California State University – San Bernardino. Accessed June 26, 2019. https://scholarworks.lib.csusb.edu/etd/777.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Garcia, Zachary. “Exploring Flag Matroids and Duality.” 2018. Web. 26 Jun 2019.

Vancouver:

Garcia Z. Exploring Flag Matroids and Duality. [Internet] [Thesis]. California State University – San Bernardino; 2018. [cited 2019 Jun 26]. Available from: https://scholarworks.lib.csusb.edu/etd/777.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Garcia Z. Exploring Flag Matroids and Duality. [Thesis]. California State University – San Bernardino; 2018. Available from: https://scholarworks.lib.csusb.edu/etd/777

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

15. Grace, Kevin Manuel. Templates for Representable Matroids.

Degree: PhD, Discrete Mathematics and Combinatorics, 2018, Louisiana State University

  The matroid structure theory of Geelen, Gerards, and Whittle has led to a hypothesis that a highly connected member of a minor-closed class of… (more)

Subjects/Keywords: matroid structure; perturbation; extremal function; even-cycle and even-cut matroids; 1-flowing matroid; golden-mean matroid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grace, K. M. (2018). Templates for Representable Matroids. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/4610

Chicago Manual of Style (16th Edition):

Grace, Kevin Manuel. “Templates for Representable Matroids.” 2018. Doctoral Dissertation, Louisiana State University. Accessed June 26, 2019. https://digitalcommons.lsu.edu/gradschool_dissertations/4610.

MLA Handbook (7th Edition):

Grace, Kevin Manuel. “Templates for Representable Matroids.” 2018. Web. 26 Jun 2019.

Vancouver:

Grace KM. Templates for Representable Matroids. [Internet] [Doctoral dissertation]. Louisiana State University; 2018. [cited 2019 Jun 26]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4610.

Council of Science Editors:

Grace KM. Templates for Representable Matroids. [Doctoral Dissertation]. Louisiana State University; 2018. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4610


Victoria University of Wellington

16. Hameed, Ali M. Topics in matroid union.

Degree: 2008, Victoria University of Wellington

 The operation of matroid union was introduced by Nash-Williams in 1966. A matroid is indecomposable if it cannot be written in the form M =… (more)

Subjects/Keywords: Matroid; Union; Topics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hameed, A. M. (2008). Topics in matroid union. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1755

Chicago Manual of Style (16th Edition):

Hameed, Ali M. “Topics in matroid union.” 2008. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/1755.

MLA Handbook (7th Edition):

Hameed, Ali M. “Topics in matroid union.” 2008. Web. 26 Jun 2019.

Vancouver:

Hameed AM. Topics in matroid union. [Internet] [Masters thesis]. Victoria University of Wellington; 2008. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/1755.

Council of Science Editors:

Hameed AM. Topics in matroid union. [Masters Thesis]. Victoria University of Wellington; 2008. Available from: http://hdl.handle.net/10063/1755


Victoria University of Wellington

17. Hall, Jasmine. Generalizing the Algebra of Throws to Rank-3 Matroids.

Degree: 2016, Victoria University of Wellington

 The algebra of throws is a geometric construction which reveals the underlying algebraic operations of addition and multiplication in a projective plane. In Desarguesian projective… (more)

Subjects/Keywords: Matroid theory; Algebra of throws; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hall, J. (2016). Generalizing the Algebra of Throws to Rank-3 Matroids. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5160

Chicago Manual of Style (16th Edition):

Hall, Jasmine. “Generalizing the Algebra of Throws to Rank-3 Matroids.” 2016. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/5160.

MLA Handbook (7th Edition):

Hall, Jasmine. “Generalizing the Algebra of Throws to Rank-3 Matroids.” 2016. Web. 26 Jun 2019.

Vancouver:

Hall J. Generalizing the Algebra of Throws to Rank-3 Matroids. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/5160.

Council of Science Editors:

Hall J. Generalizing the Algebra of Throws to Rank-3 Matroids. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5160


California State University – San Bernardino

18. Johnson, Stephen Lee. A Dual Fano, and Dual Non-Fano Matroidal Network.

Degree: MAin Mathematics, Mathematics, 2016, California State University – San Bernardino

  Matroidal networks are useful tools in furthering research in network coding. They have been used to show the limitations of linear coding solutions. In… (more)

Subjects/Keywords: uniform matroid; repesentation; duality; Other Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, S. L. (2016). A Dual Fano, and Dual Non-Fano Matroidal Network. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd/340

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Johnson, Stephen Lee. “A Dual Fano, and Dual Non-Fano Matroidal Network.” 2016. Thesis, California State University – San Bernardino. Accessed June 26, 2019. http://scholarworks.lib.csusb.edu/etd/340.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Johnson, Stephen Lee. “A Dual Fano, and Dual Non-Fano Matroidal Network.” 2016. Web. 26 Jun 2019.

Vancouver:

Johnson SL. A Dual Fano, and Dual Non-Fano Matroidal Network. [Internet] [Thesis]. California State University – San Bernardino; 2016. [cited 2019 Jun 26]. Available from: http://scholarworks.lib.csusb.edu/etd/340.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johnson SL. A Dual Fano, and Dual Non-Fano Matroidal Network. [Thesis]. California State University – San Bernardino; 2016. Available from: http://scholarworks.lib.csusb.edu/etd/340

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

19. Doker, Jeffrey Samuel. Geometry of Generalized Permutohedra.

Degree: Mathematics, 2011, University of California – Berkeley

 We study generalized permutohedra and some of the geometric properties they exhibit. We decompose matroid polytopes (and several related polytopes) into signed Minkowski sums of… (more)

Subjects/Keywords: Mathematics; associahedron; generalized permutohedron; matroid; multiplihedron; polytope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doker, J. S. (2011). Geometry of Generalized Permutohedra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/34p6s66v

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Thesis, University of California – Berkeley. Accessed June 26, 2019. http://www.escholarship.org/uc/item/34p6s66v.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Doker, Jeffrey Samuel. “Geometry of Generalized Permutohedra.” 2011. Web. 26 Jun 2019.

Vancouver:

Doker JS. Geometry of Generalized Permutohedra. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2019 Jun 26]. Available from: http://www.escholarship.org/uc/item/34p6s66v.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Doker JS. Geometry of Generalized Permutohedra. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/34p6s66v

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

20. Pivotto, Irene. On Excluded Minors for Even Cut Matroids.

Degree: 2007, University of Waterloo

 In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph… (more)

Subjects/Keywords: even cut matroid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pivotto, I. (2007). On Excluded Minors for Even Cut Matroids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2680

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pivotto, Irene. “On Excluded Minors for Even Cut Matroids.” 2007. Thesis, University of Waterloo. Accessed June 26, 2019. http://hdl.handle.net/10012/2680.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pivotto, Irene. “On Excluded Minors for Even Cut Matroids.” 2007. Web. 26 Jun 2019.

Vancouver:

Pivotto I. On Excluded Minors for Even Cut Matroids. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10012/2680.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pivotto I. On Excluded Minors for Even Cut Matroids. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2680

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

21. Critchlow, William. Randomness in classes of matroids.

Degree: 2018, Victoria University of Wellington

 This thesis is inspired by the observation that we have no good random model for matroids. That stands in contrast to graphs, which admit a… (more)

Subjects/Keywords: Matroid; Sparse paving; Transversal; Graham-Sloane

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Critchlow, W. (2018). Randomness in classes of matroids. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6949

Chicago Manual of Style (16th Edition):

Critchlow, William. “Randomness in classes of matroids.” 2018. Doctoral Dissertation, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/6949.

MLA Handbook (7th Edition):

Critchlow, William. “Randomness in classes of matroids.” 2018. Web. 26 Jun 2019.

Vancouver:

Critchlow W. Randomness in classes of matroids. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/6949.

Council of Science Editors:

Critchlow W. Randomness in classes of matroids. [Doctoral Dissertation]. Victoria University of Wellington; 2018. Available from: http://hdl.handle.net/10063/6949


Rice University

22. Arellano, John David. Algorithms to Find the Girth and Cogirth of a Linear Matroid.

Degree: PhD, Engineering, 2014, Rice University

 In this thesis, I present algorithms to find the cogirth and girth, the cardinality of the smallest cocircuit and circuit respectively, of a linear matroid.… (more)

Subjects/Keywords: set covering; linear matroid; cogirth; girth

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arellano, J. D. (2014). Algorithms to Find the Girth and Cogirth of a Linear Matroid. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87699

Chicago Manual of Style (16th Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Doctoral Dissertation, Rice University. Accessed June 26, 2019. http://hdl.handle.net/1911/87699.

MLA Handbook (7th Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Web. 26 Jun 2019.

Vancouver:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1911/87699.

Council of Science Editors:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87699


University of Manchester

23. Malic, Goran. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.

Degree: 2015, University of Manchester

 In this thesis we study the properties of Lagrangian matroids of dessins d'enfants (also known as maps on orientable surfaces) and their behaviour under the… (more)

Subjects/Keywords: Galois; dessin; matroid; Lagrangian matroid; absolute Galois group; partial duals; tropical curve; maps on surfaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malic, G. (2015). Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:283132

Chicago Manual of Style (16th Edition):

Malic, Goran. “Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.” 2015. Doctoral Dissertation, University of Manchester. Accessed June 26, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:283132.

MLA Handbook (7th Edition):

Malic, Goran. “Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.” 2015. Web. 26 Jun 2019.

Vancouver:

Malic G. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. [Internet] [Doctoral dissertation]. University of Manchester; 2015. [cited 2019 Jun 26]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:283132.

Council of Science Editors:

Malic G. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. [Doctoral Dissertation]. University of Manchester; 2015. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:283132

24. Merrick, Cynthia. Some Properties of Simplicial Geometries .

Degree: 2013, George Mason University

 Simplicial geometries, whose points are the collection of all k-element subsets of a given (finite) ground set, were described in 1970 by Crapo and Rota… (more)

Subjects/Keywords: Mathematics; combinatorial geometry; matroid; oriented matroid; simplicial geometry; simplicial matroid

…simplicial geometries on n vertices, via matroid properties such as the structure of circuits… …of all circuits that can be built using six or fewer vertices. I prove that the matroid of… …basis of the geometry (and the matroid). I show that this basis, which I call a… …different proofs. Cordovil [2] also wrote a proof of Reid’s 3-Simplicial Matroid Theorem… …This theorem states that if a matroid is representable over a field F , then it is a minor of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Merrick, C. (2013). Some Properties of Simplicial Geometries . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8360

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Merrick, Cynthia. “Some Properties of Simplicial Geometries .” 2013. Thesis, George Mason University. Accessed June 26, 2019. http://hdl.handle.net/1920/8360.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Merrick, Cynthia. “Some Properties of Simplicial Geometries .” 2013. Web. 26 Jun 2019.

Vancouver:

Merrick C. Some Properties of Simplicial Geometries . [Internet] [Thesis]. George Mason University; 2013. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1920/8360.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Merrick C. Some Properties of Simplicial Geometries . [Thesis]. George Mason University; 2013. Available from: http://hdl.handle.net/1920/8360

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Manchester

25. Malic, Goran. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.

Degree: PhD, 2015, University of Manchester

 In this thesis we study the properties of Lagrangian matroids of dessins d'enfants (also known as maps on orientable surfaces) and their behaviour under the… (more)

Subjects/Keywords: 511; Galois; dessin; matroid; Lagrangian matroid; absolute Galois group; partial duals; tropical curve; maps on surfaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malic, G. (2015). Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/grothendiecks-dessins-denfants-and-the-combinatorics-of-coxeter-groups(dd51878a-7b63-4bd2-9d27-74f10350d44e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.677793

Chicago Manual of Style (16th Edition):

Malic, Goran. “Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.” 2015. Doctoral Dissertation, University of Manchester. Accessed June 26, 2019. https://www.research.manchester.ac.uk/portal/en/theses/grothendiecks-dessins-denfants-and-the-combinatorics-of-coxeter-groups(dd51878a-7b63-4bd2-9d27-74f10350d44e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.677793.

MLA Handbook (7th Edition):

Malic, Goran. “Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups.” 2015. Web. 26 Jun 2019.

Vancouver:

Malic G. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. [Internet] [Doctoral dissertation]. University of Manchester; 2015. [cited 2019 Jun 26]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/grothendiecks-dessins-denfants-and-the-combinatorics-of-coxeter-groups(dd51878a-7b63-4bd2-9d27-74f10350d44e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.677793.

Council of Science Editors:

Malic G. Grothendieck's dessins d'enfants and the combinatorics of Coxeter groups. [Doctoral Dissertation]. University of Manchester; 2015. Available from: https://www.research.manchester.ac.uk/portal/en/theses/grothendiecks-dessins-denfants-and-the-combinatorics-of-coxeter-groups(dd51878a-7b63-4bd2-9d27-74f10350d44e).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.677793


University of Waterloo

26. Kalhan, Sanchit. The Capacitated Matroid Median Problem.

Degree: 2018, University of Waterloo

 In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median… (more)

Subjects/Keywords: Approximation algorithms; Matroid median; k-median; facility location; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalhan, S. (2018). The Capacitated Matroid Median Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13331

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kalhan, Sanchit. “The Capacitated Matroid Median Problem.” 2018. Thesis, University of Waterloo. Accessed June 26, 2019. http://hdl.handle.net/10012/13331.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kalhan, Sanchit. “The Capacitated Matroid Median Problem.” 2018. Web. 26 Jun 2019.

Vancouver:

Kalhan S. The Capacitated Matroid Median Problem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10012/13331.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kalhan S. The Capacitated Matroid Median Problem. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13331

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

27. Cho, Jung Jin. On the robustness of clustered sensor networks.

Degree: 2009, Texas A&M University

 Smart devices with multiple on-board sensors, networked through wired or wireless links, are distributed in physical systems and environments. Broad applications of such sensor networks… (more)

Subjects/Keywords: Robustness; Sensor Network; Matroid; Cogirth; Breakdown Point; Robust Estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cho, J. J. (2009). On the robustness of clustered sensor networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cho, Jung Jin. “On the robustness of clustered sensor networks.” 2009. Thesis, Texas A&M University. Accessed June 26, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cho, Jung Jin. “On the robustness of clustered sensor networks.” 2009. Web. 26 Jun 2019.

Vancouver:

Cho JJ. On the robustness of clustered sensor networks. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2527.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cho JJ. On the robustness of clustered sensor networks. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2527

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Miller, Joel. Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit.

Degree: 2014, Victoria University of Wellington

 In this thesis, we analyse the matroids which have the property that every pair of elements belongs to both a 4-circuit and a 4-cocircuit. In… (more)

Subjects/Keywords: Matroid; Structure; Discrete; Mathematics

…concepts and terminology of matroid theory. A good introduction to matroid theory can be found in… …a matroid. Then |C ∩ R| = 1. Proof. Suppose C and R are a circuit and a cocircuit of a… …matroid M with C ∩ R = {x}. We know that the complement of a cocircuit is a hyperplane… …suits us to define spikes in terms of a matroid structure which we will make use of later… …stars. Definition 2.2. Let M be a matroid. For some k ≥ 3, let the subset A = {a1 , b1… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miller, J. (2014). Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/3299

Chicago Manual of Style (16th Edition):

Miller, Joel. “Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit.” 2014. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/3299.

MLA Handbook (7th Edition):

Miller, Joel. “Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit.” 2014. Web. 26 Jun 2019.

Vancouver:

Miller J. Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit. [Internet] [Masters thesis]. Victoria University of Wellington; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/3299.

Council of Science Editors:

Miller J. Matroids in which every pair of elements belongs to both a 4-circuit and a 4-cocircuit. [Masters Thesis]. Victoria University of Wellington; 2014. Available from: http://hdl.handle.net/10063/3299

29. Mo, Songbao. The Structure of Connectivity Functions.

Degree: 2014, Victoria University of Wellington

 Graphs, matroids and polymatroids all have associated connectivity functions, and many properties of these structures follow from properties of their connectivity functions. This motivates the… (more)

Subjects/Keywords: Connectivity; Matroid; Polymatroid

…follow the convention in matroid theory to write x instead of {x} to denote the set… …any unexplained matroid terminologies that appear later in this thesis follow from [5… …x5D;. A matroid M is an ordered pair (E, r), where E is a finite set, and r is an… …x29;, for all X ⊆ Y ⊆ E. (R4) r is submodular. If M is the matroid (E, r)… …then M is called the matroid on E and the function r is called the rank function of matroid M… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mo, S. (2014). The Structure of Connectivity Functions. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/3426

Chicago Manual of Style (16th Edition):

Mo, Songbao. “The Structure of Connectivity Functions.” 2014. Masters Thesis, Victoria University of Wellington. Accessed June 26, 2019. http://hdl.handle.net/10063/3426.

MLA Handbook (7th Edition):

Mo, Songbao. “The Structure of Connectivity Functions.” 2014. Web. 26 Jun 2019.

Vancouver:

Mo S. The Structure of Connectivity Functions. [Internet] [Masters thesis]. Victoria University of Wellington; 2014. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/10063/3426.

Council of Science Editors:

Mo S. The Structure of Connectivity Functions. [Masters Thesis]. Victoria University of Wellington; 2014. Available from: http://hdl.handle.net/10063/3426


University of Kentucky

30. Stokes, Erik. THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS.

Degree: 2008, University of Kentucky

 Making use of algebraic and combinatorial techniques, we study two topics: the arithmetic degree of squarefree strongly stable ideals and the h-vectors of matroid complexes.… (more)

Subjects/Keywords: simplicial complex; matroid; h-vector; arithmetic degree; Stanley-Reisner ideal; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stokes, E. (2008). THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS. (Doctoral Dissertation). University of Kentucky. Retrieved from http://uknowledge.uky.edu/gradschool_diss/636

Chicago Manual of Style (16th Edition):

Stokes, Erik. “THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS.” 2008. Doctoral Dissertation, University of Kentucky. Accessed June 26, 2019. http://uknowledge.uky.edu/gradschool_diss/636.

MLA Handbook (7th Edition):

Stokes, Erik. “THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS.” 2008. Web. 26 Jun 2019.

Vancouver:

Stokes E. THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS. [Internet] [Doctoral dissertation]. University of Kentucky; 2008. [cited 2019 Jun 26]. Available from: http://uknowledge.uky.edu/gradschool_diss/636.

Council of Science Editors:

Stokes E. THE h-VECTORS OF MATROIDS AND THE ARITHMETIC DEGREE OF SQUAREFREE STRONGLY STABLE IDEALS. [Doctoral Dissertation]. University of Kentucky; 2008. Available from: http://uknowledge.uky.edu/gradschool_diss/636

[1] [2] [3]

.