25,161
edits
Changes
Created page with "'''Home * People * Landon Rabern''' '''Landon W. Rabern''', an American mathematician and software engineer in the AI industry. His research interests cover..."
'''[[Main Page|Home]] * [[People]] * Landon Rabern'''
'''Landon W. Rabern''',
an American mathematician and software engineer in the AI industry. His research interests covers [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem clique problems]], [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] and [https://en.wikipedia.org/wiki/Edge_coloring edge coloring].
He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003,
a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and
a Ph.D. from [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University] in 2013.
As a computer chess programmer, Landon Rabern is author the [[WinBoard]] compatible chess engine [[Betsy]] <ref>[https://www.spaghettimonster.org/wp-content/uploads/2009/06/landon_resume.pdf landon_resume.pdf]</ref>, which was the first published chess engine able to play [[Chess960]] <ref>[https://chess-tigers.de/index_news.php?id=308&rubrik=4&PHPSESSID=d71dfe17e7e8aae16adce6f8fb284410 Der Chess960-Express ist nicht mehr aufzuhalten], [https://chess-tigers.de/cttc_main.php?rubrik=7 Chess Tigers Training Center], July 20, 2005 (German)</ref>.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/r/Rabern:Landon dblp: Landon Rabern]</ref>
==2003==
* [[Landon Rabern|Landon W. Rabern]] ('''2003'''). ''[https://scholar.rose-hulman.edu/rhumj/vol4/iss1/3/ Properties of Magic Squares of Squares]''. [https://scholar.rose-hulman.edu/rhumj/ Rose-Hulman Undergraduate Mathematics Journal], Vol. 4, No. 1
==2005 ...==
* [[Landon Rabern]] ('''2005'''). ''Some bounds on convex combinations of ω and χ for decompositions into many parts''. [https://arxiv.org/abs/math/0512291 arXiv:math/0512291]
* [[Landon Rabern]] ('''2006'''). ''New upper bounds on the chromatic number of a graph''. [https://arxiv.org/abs/math/0606632 arXiv:math/0606632]
* [[Landon Rabern]] ('''2006'''). ''[https://epubs.siam.org/doi/abs/10.1137/050626545 On Graph Associations]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 20, No. 2
* [[Landon Rabern]] ('''2007'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n22 The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14
* [[Landon Rabern]] ('''2008'''). ''[https://epubs.siam.org/doi/abs/10.1137/060659193 A Note On Reed's Conjecture]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 22, No. 2 <ref>[https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph Chvátal graph from Wikipedia]</ref>
* [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705]
==2010 ...==
* [[Landon Rabern]] ('''2011'''). ''An improvement on Brooks' Theorem''. [https://arxiv.org/abs/1102.1021 arXiv:1102.1021] <ref>[https://en.wikipedia.org/wiki/Brooks%27_theorem Brooks' theorem from Wikipedia]</ref>
* [[Landon Rabern]] ('''2011'''). ''A note on vertex partitions''. [https://arxiv.org/abs/1107.1735 arXiv:1107.1735]
* [[Landon Rabern]] ('''2012'''). ''Partitioning and coloring with degree constraints''. [https://arxiv.org/abs/1202.5855 arXiv:1202.5855]
* [[Landon Rabern]] ('''2012'''). ''A different short proof of Brooks' theorem''. [https://arxiv.org/abs/1205.3253 arXiv:1205.3253]
* [[Landon Rabern]] ('''2012'''). ''Coloring graphs with dense neighborhoods''. [https://arxiv.org/abs/1209.3646 arXiv:1209.3646]
* [[Landon Rabern]] ('''2013'''). ''Coloring graphs from almost maximum degree sized palettes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University], advisor: [[Mathematician#HAKierstead|Henry A. Kierstead], [https://repository.asu.edu/attachments/110259/content/Rabern_asu_0010E_12641.pdf pdf]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2014'''). ''Brooks' Theorem and Beyond''. [https://arxiv.org/abs/1403.0479 arXiv:1403.0479]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2014'''). ''Improved lower bounds on the number of edges in list critical and online list critical graphs''. [https://arxiv.org/abs/1406.7355 arXiv:1406.7355]
==2015 ...==
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Subcubic edge chromatic critical graphs have many edges''. [https://arxiv.org/abs/1506.04225 arXiv:1506.04225]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Edge-coloring via fixable subgraphs''. [https://arxiv.org/abs/1507.05600 arXiv:1507.05600]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2015'''). ''Extracting list colorings from large independent sets''. [https://arxiv.org/abs/1512.08130 arXiv:1512.08130]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of 4-list-critical graphs''. [https://arxiv.org/abs/1602.08532 arXiv:1602.08532]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of k-list-critical graphs''. [https://arxiv.org/abs/1608.06989 arXiv:1608.06989]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2017'''). ''The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4''. [https://arxiv.org/abs/1703.00959 arXiv:1703.00959]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=128512 Betsy 5.0 is now winboard compatable] by [[Landon Rabern]], [[CCC]], September 06, 2000
* [https://www.stmintz.com/ccc/index.php?id=178491 Betsy 5.26] by [[Landon Rabern]], [[CCC]], July 06, 2001
=External Links=
* [https://www.linkedin.com/in/landon-rabern-421a3173 landon rabern | LinkedIn]
* [https://scholar.google.com/citations?user=aZg5kIEAAAAJ&hl=en landon rabern - Google Scholar Citations]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=176173 Landon Rabern - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Rabern]]
[[Category:Chess Programmer|Rabern]]
'''Landon W. Rabern''',
an American mathematician and software engineer in the AI industry. His research interests covers [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem clique problems]], [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] and [https://en.wikipedia.org/wiki/Edge_coloring edge coloring].
He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003,
a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and
a Ph.D. from [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University] in 2013.
As a computer chess programmer, Landon Rabern is author the [[WinBoard]] compatible chess engine [[Betsy]] <ref>[https://www.spaghettimonster.org/wp-content/uploads/2009/06/landon_resume.pdf landon_resume.pdf]</ref>, which was the first published chess engine able to play [[Chess960]] <ref>[https://chess-tigers.de/index_news.php?id=308&rubrik=4&PHPSESSID=d71dfe17e7e8aae16adce6f8fb284410 Der Chess960-Express ist nicht mehr aufzuhalten], [https://chess-tigers.de/cttc_main.php?rubrik=7 Chess Tigers Training Center], July 20, 2005 (German)</ref>.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/r/Rabern:Landon dblp: Landon Rabern]</ref>
==2003==
* [[Landon Rabern|Landon W. Rabern]] ('''2003'''). ''[https://scholar.rose-hulman.edu/rhumj/vol4/iss1/3/ Properties of Magic Squares of Squares]''. [https://scholar.rose-hulman.edu/rhumj/ Rose-Hulman Undergraduate Mathematics Journal], Vol. 4, No. 1
==2005 ...==
* [[Landon Rabern]] ('''2005'''). ''Some bounds on convex combinations of ω and χ for decompositions into many parts''. [https://arxiv.org/abs/math/0512291 arXiv:math/0512291]
* [[Landon Rabern]] ('''2006'''). ''New upper bounds on the chromatic number of a graph''. [https://arxiv.org/abs/math/0606632 arXiv:math/0606632]
* [[Landon Rabern]] ('''2006'''). ''[https://epubs.siam.org/doi/abs/10.1137/050626545 On Graph Associations]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 20, No. 2
* [[Landon Rabern]] ('''2007'''). ''[https://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n22 The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14
* [[Landon Rabern]] ('''2008'''). ''[https://epubs.siam.org/doi/abs/10.1137/060659193 A Note On Reed's Conjecture]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Discrete_Mathematics SIAM Journal on Discrete Mathematics], Vol. 22, No. 2 <ref>[https://en.wikipedia.org/wiki/Chv%C3%A1tal_graph Chvátal graph from Wikipedia]</ref>
* [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705]
==2010 ...==
* [[Landon Rabern]] ('''2011'''). ''An improvement on Brooks' Theorem''. [https://arxiv.org/abs/1102.1021 arXiv:1102.1021] <ref>[https://en.wikipedia.org/wiki/Brooks%27_theorem Brooks' theorem from Wikipedia]</ref>
* [[Landon Rabern]] ('''2011'''). ''A note on vertex partitions''. [https://arxiv.org/abs/1107.1735 arXiv:1107.1735]
* [[Landon Rabern]] ('''2012'''). ''Partitioning and coloring with degree constraints''. [https://arxiv.org/abs/1202.5855 arXiv:1202.5855]
* [[Landon Rabern]] ('''2012'''). ''A different short proof of Brooks' theorem''. [https://arxiv.org/abs/1205.3253 arXiv:1205.3253]
* [[Landon Rabern]] ('''2012'''). ''Coloring graphs with dense neighborhoods''. [https://arxiv.org/abs/1209.3646 arXiv:1209.3646]
* [[Landon Rabern]] ('''2013'''). ''Coloring graphs from almost maximum degree sized palettes''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Arizona_State_University Arizona State University], advisor: [[Mathematician#HAKierstead|Henry A. Kierstead], [https://repository.asu.edu/attachments/110259/content/Rabern_asu_0010E_12641.pdf pdf]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2014'''). ''Brooks' Theorem and Beyond''. [https://arxiv.org/abs/1403.0479 arXiv:1403.0479]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2014'''). ''Improved lower bounds on the number of edges in list critical and online list critical graphs''. [https://arxiv.org/abs/1406.7355 arXiv:1406.7355]
==2015 ...==
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Subcubic edge chromatic critical graphs have many edges''. [https://arxiv.org/abs/1506.04225 arXiv:1506.04225]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2015'''). ''Edge-coloring via fixable subgraphs''. [https://arxiv.org/abs/1507.05600 arXiv:1507.05600]
* [[Mathematician#HAKierstead|Hal Kierstead]], [[Landon Rabern]] ('''2015'''). ''Extracting list colorings from large independent sets''. [https://arxiv.org/abs/1512.08130 arXiv:1512.08130]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of 4-list-critical graphs''. [https://arxiv.org/abs/1602.08532 arXiv:1602.08532]
* [[Landon Rabern]] ('''2016'''). ''A better lower bound on average degree of k-list-critical graphs''. [https://arxiv.org/abs/1608.06989 arXiv:1608.06989]
* [[Mathematician#DWCranston|Daniel W. Cranston]], [[Landon Rabern]] ('''2017'''). ''The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4''. [https://arxiv.org/abs/1703.00959 arXiv:1703.00959]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=128512 Betsy 5.0 is now winboard compatable] by [[Landon Rabern]], [[CCC]], September 06, 2000
* [https://www.stmintz.com/ccc/index.php?id=178491 Betsy 5.26] by [[Landon Rabern]], [[CCC]], July 06, 2001
=External Links=
* [https://www.linkedin.com/in/landon-rabern-421a3173 landon rabern | LinkedIn]
* [https://scholar.google.com/citations?user=aZg5kIEAAAAJ&hl=en landon rabern - Google Scholar Citations]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=176173 Landon Rabern - The Mathematics Genealogy Project]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Rabern]]
[[Category:Chess Programmer|Rabern]]
