Advanced search options

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

You searched for `subject:(regularity lemma)`

.
Showing records 1 – 16 of
16 total matches.

▼ Search Limiters

1.
Song, Fei.
Practical and theoretical applications of the *Regularity* * Lemma*.

Degree: PhD, 2013, Worcester Polytechnic Institute

URL: etd-042213-111950 ; https://digitalcommons.wpi.edu/etd-dissertations/144

► The *Regularity* *Lemma* of Szemeredi is a fundamental tool in extremal graph theory with a wide range of applications in theoretical computer science. Partly as…
(more)

Subjects/Keywords: data mining; regularity lemma; combinatorics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Song, F. (2013). Practical and theoretical applications of the Regularity Lemma. (Doctoral Dissertation). Worcester Polytechnic Institute. Retrieved from etd-042213-111950 ; https://digitalcommons.wpi.edu/etd-dissertations/144

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

Song, Fei. “Practical and theoretical applications of the Regularity Lemma.” 2013. Doctoral Dissertation, Worcester Polytechnic Institute. Accessed November 26, 2020. etd-042213-111950 ; https://digitalcommons.wpi.edu/etd-dissertations/144.

MLA Handbook (7^{th} Edition):

Song, Fei. “Practical and theoretical applications of the Regularity Lemma.” 2013. Web. 26 Nov 2020.

Vancouver:

Song F. Practical and theoretical applications of the Regularity Lemma. [Internet] [Doctoral dissertation]. Worcester Polytechnic Institute; 2013. [cited 2020 Nov 26]. Available from: etd-042213-111950 ; https://digitalcommons.wpi.edu/etd-dissertations/144.

Council of Science Editors:

Song F. Practical and theoretical applications of the Regularity Lemma. [Doctoral Dissertation]. Worcester Polytechnic Institute; 2013. Available from: etd-042213-111950 ; https://digitalcommons.wpi.edu/etd-dissertations/144

NSYSU

2. Li, Wei-shuo. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.

Degree: PhD, Computer Science and Engineering, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007

► In this thesis, we present analytical analysis of key distribution schemes on wireless sensor networks. Since wireless sensor network is under unreliable environment, many random…
(more)

Subjects/Keywords: Wireless sensor networks; random key pre-distribution; regularity lemma

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, W. (2010). Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007

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

Li, Wei-shuo. “Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.” 2010. Doctoral Dissertation, NSYSU. Accessed November 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007.

MLA Handbook (7^{th} Edition):

Li, Wei-shuo. “Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.” 2010. Web. 26 Nov 2020.

Vancouver:

Li W. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2020 Nov 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007.

Council of Science Editors:

Li W. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007

Carnegie Mellon University

3. Yilma, Zelealem Belaineh. Results in Extremal Graph and Hypergraph Theory.

Degree: 2011, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/49

► In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or minima of certain functions and identifying the…
(more)

Subjects/Keywords: Erdos-Ko-Rado; Turan graphs; Szemeredi’s Regularity Lemma; Colorcritical Graphs; Supersaturation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yilma, Z. B. (2011). Results in Extremal Graph and Hypergraph Theory. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/49

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

Yilma, Zelealem Belaineh. “Results in Extremal Graph and Hypergraph Theory.” 2011. Thesis, Carnegie Mellon University. Accessed November 26, 2020. http://repository.cmu.edu/dissertations/49.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yilma, Zelealem Belaineh. “Results in Extremal Graph and Hypergraph Theory.” 2011. Web. 26 Nov 2020.

Vancouver:

Yilma ZB. Results in Extremal Graph and Hypergraph Theory. [Internet] [Thesis]. Carnegie Mellon University; 2011. [cited 2020 Nov 26]. Available from: http://repository.cmu.edu/dissertations/49.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yilma ZB. Results in Extremal Graph and Hypergraph Theory. [Thesis]. Carnegie Mellon University; 2011. Available from: http://repository.cmu.edu/dissertations/49

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

4. Cros, Lluis Vena. The Removal Property for Linear Configurations in Compact Abelian Groups.

Degree: PhD, 2014, University of Toronto

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

► The combinatorial removal *lemma* states that, if a (hyper)graph K has not many copies of the fixed (hyper)graph H , then K can be made…
(more)

Subjects/Keywords: compact abelian groups; homomorphisms of finite abelian groups; integer linear systems; regularity lemma; removal lemma; 0405

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cros, L. V. (2014). The Removal Property for Linear Configurations in Compact Abelian Groups. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/68308

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

Cros, Lluis Vena. “The Removal Property for Linear Configurations in Compact Abelian Groups.” 2014. Doctoral Dissertation, University of Toronto. Accessed November 26, 2020. http://hdl.handle.net/1807/68308.

MLA Handbook (7^{th} Edition):

Cros, Lluis Vena. “The Removal Property for Linear Configurations in Compact Abelian Groups.” 2014. Web. 26 Nov 2020.

Vancouver:

Cros LV. The Removal Property for Linear Configurations in Compact Abelian Groups. [Internet] [Doctoral dissertation]. University of Toronto; 2014. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/1807/68308.

Council of Science Editors:

Cros LV. The Removal Property for Linear Configurations in Compact Abelian Groups. [Doctoral Dissertation]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68308

5. Stagni, Henrique. Teste de propriedades em torneios.

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

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/ ;

►

Teste de propriedades em grafos consiste no estudo de algoritmos aleatórios sublineares que determinam se um grafo G de entrada com n vértices satisfaz uma… (more)

Subjects/Keywords: Lema de regularidade; Property testing; Regularity lemma; Teste de propriedades; Torneios; Tournaments

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stagni, H. (2015). Teste de propriedades em torneios. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/ ;

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

Stagni, Henrique. “Teste de propriedades em torneios.” 2015. Masters Thesis, University of São Paulo. Accessed November 26, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/ ;.

MLA Handbook (7^{th} Edition):

Stagni, Henrique. “Teste de propriedades em torneios.” 2015. Web. 26 Nov 2020.

Vancouver:

Stagni H. Teste de propriedades em torneios. [Internet] [Masters thesis]. University of São Paulo; 2015. [cited 2020 Nov 26]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/ ;.

Council of Science Editors:

Stagni H. Teste de propriedades em torneios. [Masters Thesis]. University of São Paulo; 2015. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21072015-112930/ ;

6. Parente, Roberto Freitas. Quantidade de orientações de grafos livres de circuitos direcionados cíclicos.

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

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22032012-150640/ ;

►

Seja Húma orientação do grafo H. Alon e Yuster [The number of orientations having no fixed tounament, Combinatória, 26 (2006), no. 1, 1-6] propuseram o… (more)

Subjects/Keywords: forbidden orientations.; Grafos aleatórios; Lema da regularidade esparso; Orientações proibidas; Random graphs; sparse regularity lemma

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Parente, R. F. (2011). Quantidade de orientações de grafos livres de circuitos direcionados cíclicos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22032012-150640/ ;

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

Parente, Roberto Freitas. “Quantidade de orientações de grafos livres de circuitos direcionados cíclicos.” 2011. Masters Thesis, University of São Paulo. Accessed November 26, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22032012-150640/ ;.

MLA Handbook (7^{th} Edition):

Parente, Roberto Freitas. “Quantidade de orientações de grafos livres de circuitos direcionados cíclicos.” 2011. Web. 26 Nov 2020.

Vancouver:

Parente RF. Quantidade de orientações de grafos livres de circuitos direcionados cíclicos. [Internet] [Masters thesis]. University of São Paulo; 2011. [cited 2020 Nov 26]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22032012-150640/ ;.

Council of Science Editors:

Parente RF. Quantidade de orientações de grafos livres de circuitos direcionados cíclicos. [Masters Thesis]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-22032012-150640/ ;

University of Oxford

7. Law, Hiu-Fai. Trees and graphs : congestion, polynomials and reconstruction.

Degree: PhD, 2011, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206

► Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained.…
(more)

Subjects/Keywords: 511.52; Combinatorics; spanning tree congestion; random graphs; regularity lemma; inverse problems; reconstruction; partition function

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Law, H. (2011). Trees and graphs : congestion, polynomials and reconstruction. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206

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

Law, Hiu-Fai. “Trees and graphs : congestion, polynomials and reconstruction.” 2011. Doctoral Dissertation, University of Oxford. Accessed November 26, 2020. http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206.

MLA Handbook (7^{th} Edition):

Law, Hiu-Fai. “Trees and graphs : congestion, polynomials and reconstruction.” 2011. Web. 26 Nov 2020.

Vancouver:

Law H. Trees and graphs : congestion, polynomials and reconstruction. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2020 Nov 26]. Available from: http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206.

Council of Science Editors:

Law H. Trees and graphs : congestion, polynomials and reconstruction. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206

8.
Trivedi, Shubhendu.
A Graph Theoretic Clustering Algorithm based on the *Regularity* *Lemma* and Strategies to Exploit Clustering for Prediction.

Degree: MS, 2012, Worcester Polytechnic Institute

URL: etd-043012-104639 ; https://digitalcommons.wpi.edu/etd-theses/573

► The fact that clustering is perhaps the most used technique for exploratory data analysis is only a semaphore that underlines its fundamental importance. The general…
(more)

Subjects/Keywords: Machine Learning; Graph Mining; Unsupervised Learning; Ensemble Learning; Semi-Supervised Learning; Regularity Lemma; Graph Partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Trivedi, S. (2012). A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-043012-104639 ; https://digitalcommons.wpi.edu/etd-theses/573

Not specified: Masters Thesis or Doctoral Dissertation

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

Trivedi, Shubhendu. “A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction.” 2012. Thesis, Worcester Polytechnic Institute. Accessed November 26, 2020. etd-043012-104639 ; https://digitalcommons.wpi.edu/etd-theses/573.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Trivedi, Shubhendu. “A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction.” 2012. Web. 26 Nov 2020.

Vancouver:

Trivedi S. A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction. [Internet] [Thesis]. Worcester Polytechnic Institute; 2012. [cited 2020 Nov 26]. Available from: etd-043012-104639 ; https://digitalcommons.wpi.edu/etd-theses/573.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Trivedi S. A Graph Theoretic Clustering Algorithm based on the Regularity Lemma and Strategies to Exploit Clustering for Prediction. [Thesis]. Worcester Polytechnic Institute; 2012. Available from: etd-043012-104639 ; https://digitalcommons.wpi.edu/etd-theses/573

Not specified: Masters Thesis or Doctoral Dissertation

9. Zang, Chuanyun. Matchings and Tilings in Hypergraphs.

Degree: PhD, Mathematics and Statistics, 2016, Georgia State University

URL: https://scholarworks.gsu.edu/math_diss/31

► We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2)…
(more)

Subjects/Keywords: Absorbing method; Regularity lemma; Perfect matching; Graph tiling; Graph packing; Minimum degree.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zang, C. (2016). Matchings and Tilings in Hypergraphs. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_diss/31

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

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Doctoral Dissertation, Georgia State University. Accessed November 26, 2020. https://scholarworks.gsu.edu/math_diss/31.

MLA Handbook (7^{th} Edition):

Zang, Chuanyun. “Matchings and Tilings in Hypergraphs.” 2016. Web. 26 Nov 2020.

Vancouver:

Zang C. Matchings and Tilings in Hypergraphs. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2020 Nov 26]. Available from: https://scholarworks.gsu.edu/math_diss/31.

Council of Science Editors:

Zang C. Matchings and Tilings in Hypergraphs. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/math_diss/31

University of South Florida

10.
Khan, Shoaib Amjad.
A Hypergraph *Regularity* Method for Linear Hypergraphs.

Degree: 2009, University of South Florida

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

► Szemerédi's *Regularity* *Lemma* is powerful tool in Graph Theory, yielding many applications in areas such as Extremal Graph Theory, Combinatorial Number Theory and Theoretical Computer…
(more)

Subjects/Keywords: Regularity lemma; Counting lemma; Forbidden families; F-counting algorithm; Constructive removal lemma; American Studies; Arts and Humanities

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khan, S. A. (2009). A Hypergraph Regularity Method for Linear Hypergraphs. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/2042

Not specified: Masters Thesis or Doctoral Dissertation

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

Khan, Shoaib Amjad. “A Hypergraph Regularity Method for Linear Hypergraphs.” 2009. Thesis, University of South Florida. Accessed November 26, 2020. https://scholarcommons.usf.edu/etd/2042.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Khan, Shoaib Amjad. “A Hypergraph Regularity Method for Linear Hypergraphs.” 2009. Web. 26 Nov 2020.

Vancouver:

Khan SA. A Hypergraph Regularity Method for Linear Hypergraphs. [Internet] [Thesis]. University of South Florida; 2009. [cited 2020 Nov 26]. Available from: https://scholarcommons.usf.edu/etd/2042.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khan SA. A Hypergraph Regularity Method for Linear Hypergraphs. [Thesis]. University of South Florida; 2009. Available from: https://scholarcommons.usf.edu/etd/2042

Not specified: Masters Thesis or Doctoral Dissertation

11. Sampaio, Rudini Menezes. Limites de seqüências de permutações de inteiros.

Degree: PhD, Ciência da Computação, 2008, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08122008-163417/ ;

►

Nesta tese, introduzimos o conceito de sequência convergente de permutações e provamos a existência de um objeto limite para tais sequências. Introduzimos ainda um novo… (more)

Subjects/Keywords: convergent sequences; densidade de subpermutações; density of subpermutations; Lema da regularidade; limit object; objeto limite; permutações; permutations; quase-aleatoriedade; quasirandomness; Regularity lemma; sequências convergentes; testabilidade; testability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sampaio, R. M. (2008). Limites de seqüências de permutações de inteiros. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08122008-163417/ ;

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

Sampaio, Rudini Menezes. “Limites de seqüências de permutações de inteiros.” 2008. Doctoral Dissertation, University of São Paulo. Accessed November 26, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08122008-163417/ ;.

MLA Handbook (7^{th} Edition):

Sampaio, Rudini Menezes. “Limites de seqüências de permutações de inteiros.” 2008. Web. 26 Nov 2020.

Vancouver:

Sampaio RM. Limites de seqüências de permutações de inteiros. [Internet] [Doctoral dissertation]. University of São Paulo; 2008. [cited 2020 Nov 26]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08122008-163417/ ;.

Council of Science Editors:

Sampaio RM. Limites de seqüências de permutações de inteiros. [Doctoral Dissertation]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08122008-163417/ ;

Georgia State University

12. Cook, Brian Michael. An Extension of Ramsey's Theorem to Multipartite Graphs.

Degree: MS, Mathematics and Statistics, 2007, Georgia State University

URL: https://scholarworks.gsu.edu/math_theses/29

► Ramsey Theorem, in the most simple form, states that if we are given a positive integer l, there exists a minimal integer r(l), called the…
(more)

Subjects/Keywords: Ramsey numbers; Multipartite Ramsey numbers; Regularity Lemma; p-arrangeable; Blow-Up Lemma; d-degenerate.; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cook, B. M. (2007). An Extension of Ramsey's Theorem to Multipartite Graphs. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_theses/29

Not specified: Masters Thesis or Doctoral Dissertation

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

Cook, Brian Michael. “An Extension of Ramsey's Theorem to Multipartite Graphs.” 2007. Thesis, Georgia State University. Accessed November 26, 2020. https://scholarworks.gsu.edu/math_theses/29.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cook, Brian Michael. “An Extension of Ramsey's Theorem to Multipartite Graphs.” 2007. Web. 26 Nov 2020.

Vancouver:

Cook BM. An Extension of Ramsey's Theorem to Multipartite Graphs. [Internet] [Thesis]. Georgia State University; 2007. [cited 2020 Nov 26]. Available from: https://scholarworks.gsu.edu/math_theses/29.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cook BM. An Extension of Ramsey's Theorem to Multipartite Graphs. [Thesis]. Georgia State University; 2007. Available from: https://scholarworks.gsu.edu/math_theses/29

Not specified: Masters Thesis or Doctoral Dissertation

Georgia State University

13. Bush, Albert. Two Problems on Bipartite Graphs.

Degree: MS, Mathematics and Statistics, 2009, Georgia State University

URL: https://scholarworks.gsu.edu/math_theses/72

► Erdos proved the well-known result that every graph has a spanning, bipartite subgraph such that every vertex has degree at least half of its original…
(more)

Subjects/Keywords: Graph theory; Regularity Lemma; Graph tiling; Graph packing; Bipartite Graphs; Bipartite subgraphs; Blow up Lemma; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bush, A. (2009). Two Problems on Bipartite Graphs. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_theses/72

Not specified: Masters Thesis or Doctoral Dissertation

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

Bush, Albert. “Two Problems on Bipartite Graphs.” 2009. Thesis, Georgia State University. Accessed November 26, 2020. https://scholarworks.gsu.edu/math_theses/72.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bush, Albert. “Two Problems on Bipartite Graphs.” 2009. Web. 26 Nov 2020.

Vancouver:

Bush A. Two Problems on Bipartite Graphs. [Internet] [Thesis]. Georgia State University; 2009. [cited 2020 Nov 26]. Available from: https://scholarworks.gsu.edu/math_theses/72.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bush A. Two Problems on Bipartite Graphs. [Thesis]. Georgia State University; 2009. Available from: https://scholarworks.gsu.edu/math_theses/72

Not specified: Masters Thesis or Doctoral Dissertation

14.
Guerand, Jessica.
Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic *regularity* à la De Giorgi.

Degree: Docteur es, Mathématiques, 2018, Paris Sciences et Lettres (ComUE)

URL: http://www.theses.fr/2018PSLEE059

►

Cette thèse est constituée de deux parties. Une première partie est consacrée à l’étude des équations de Hamilton-Jacobi du premier ordre. Ces équations apparaissent en… (more)

Subjects/Keywords: Équations de Hamilton-Jacobi; Solutions de viscosité; Conditions de bord effectives; Régularité elliptique à la De Giorgi; Lemme des valeurs intermédiaires; Hamilton-Jacobi equations; Viscosity solutions; Effective boundary conditions; De Giorgi elliptic regularity; Intermediate value lemma; 510

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Guerand, J. (2018). Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic regularity à la De Giorgi. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2018PSLEE059

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

Guerand, Jessica. “Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic regularity à la De Giorgi.” 2018. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed November 26, 2020. http://www.theses.fr/2018PSLEE059.

MLA Handbook (7^{th} Edition):

Guerand, Jessica. “Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic regularity à la De Giorgi.” 2018. Web. 26 Nov 2020.

Vancouver:

Guerand J. Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic regularity à la De Giorgi. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2018. [cited 2020 Nov 26]. Available from: http://www.theses.fr/2018PSLEE059.

Council of Science Editors:

Guerand J. Équations de Hamilton-Jacobi discontinues et régularité parabolique à la De Giorgi : Discontinuous Hamilton-Jacobi equations and parabolic regularity à la De Giorgi. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2018. Available from: http://www.theses.fr/2018PSLEE059

15. Kalyanasundaram, Subrahmanyam. Turing machine algorithms and studies in quasi-randomness.

Degree: PhD, Computing, 2011, Georgia Tech

URL: http://hdl.handle.net/1853/42808

► Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely…
(more)

Subjects/Keywords: Quasi-randomness; Algorithm; Lower bound; Turing machines; Regularity lemma; Combinatorics; Complexity theory; Machine theory; Algorithms; Computer science; Computer science Mathematics

…Kannan *Regularity*. The Frieze-Kannan
*regularity* *lemma* is a powerful tool in combinatorics. The… …viii
the Frieze-Kannan *regularity* *lemma* in deterministic sub-cubic time. In this thesis… …the Frieze-Kannan *regularity* *lemma*.
Even Cycles and Quasi-Random Tournaments. Chung and… …type lower bound for the strong *regularity* *lemma*. The *regularity*
*lemma* of Szemer´
edi asserts… …the *regularity* *lemma*, that allows
one to have an arbitrary control on this measure of quasi…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kalyanasundaram, S. (2011). Turing machine algorithms and studies in quasi-randomness. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/42808

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

Kalyanasundaram, Subrahmanyam. “Turing machine algorithms and studies in quasi-randomness.” 2011. Doctoral Dissertation, Georgia Tech. Accessed November 26, 2020. http://hdl.handle.net/1853/42808.

MLA Handbook (7^{th} Edition):

Kalyanasundaram, Subrahmanyam. “Turing machine algorithms and studies in quasi-randomness.” 2011. Web. 26 Nov 2020.

Vancouver:

Kalyanasundaram S. Turing machine algorithms and studies in quasi-randomness. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/1853/42808.

Council of Science Editors:

Kalyanasundaram S. Turing machine algorithms and studies in quasi-randomness. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/42808

16. Salehi Nowbandegani, Pouria. Precise Partitions Of Large Graphs.

Degree: MSin Mathematics (M.S.), Department of Mathematical Sciences, 2014, Georgia Southern University

URL: https://digitalcommons.georgiasouthern.edu/etd/1181

► First by using an easy application of the *Regularity* *Lemma*, we extend some known results about cycles of many lengths to include a specified…
(more)

Subjects/Keywords: ETD; Regularity; Lemma; cycles; specified edge; Hamiltonian cycle; Discrete Mathematics and Combinatorics; Jack N. Averitt College of Graduate Studies, Electronic Theses & Dissertations, ETDs, Student Research

…B.
The following is the famous *Regularity* *Lemma* of Szemer´
edi.
*Lemma* 1 (*Regularity*… …an example of
an easy application of the *Regularity* *Lemma* (*Lemma* 1 below).
2.1… …*lemma*, we first state an easy fact which follows from
the definition of super-*regularity*.
Fact… …extremal lemmas based on the structure of the reduced
graph provided by the *Regularity* *Lemma*. Our… …of Theorem 11
. . . . . . . . . . . . . . . . . . . . .
12
3.3
Proof of *Lemma* 7…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Salehi Nowbandegani, P. (2014). Precise Partitions Of Large Graphs. (Masters Thesis). Georgia Southern University. Retrieved from https://digitalcommons.georgiasouthern.edu/etd/1181

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

Salehi Nowbandegani, Pouria. “Precise Partitions Of Large Graphs.” 2014. Masters Thesis, Georgia Southern University. Accessed November 26, 2020. https://digitalcommons.georgiasouthern.edu/etd/1181.

MLA Handbook (7^{th} Edition):

Salehi Nowbandegani, Pouria. “Precise Partitions Of Large Graphs.” 2014. Web. 26 Nov 2020.

Vancouver:

Salehi Nowbandegani P. Precise Partitions Of Large Graphs. [Internet] [Masters thesis]. Georgia Southern University; 2014. [cited 2020 Nov 26]. Available from: https://digitalcommons.georgiasouthern.edu/etd/1181.

Council of Science Editors:

Salehi Nowbandegani P. Precise Partitions Of Large Graphs. [Masters Thesis]. Georgia Southern University; 2014. Available from: https://digitalcommons.georgiasouthern.edu/etd/1181