25,161
edits
Changes
no edit summary
* [[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>
* [http://brianrabern.net/ Brian Rabern], [[Landon Rabern]] ('''2008'''). ''[https://academic.oup.com/analysis/article-abstract/68/2/105/2740445?redirectedFrom=fulltext A simple solution to the hardest logic puzzle ever]''. [https://en.wikipedia.org/wiki/Analysis_(journal) Analysis], Vol. 68, No. 2 <ref>[[Mathematician#GBoolos|George Boolos]] credits [[Raymond Smullyan]] as the originator of the puzzle and [[John McCarthy]] with adding the difficulty of not knowing what '''da''' and '''ja''' mean, [[Mathematician#GBoolos|George Boolos]] ('''1996'''). ''[https://www.pdcnet.org/harvardreview/content/harvardreview_1996_0006_0001_0062_0065 The Hardest Logic Puzzle Ever]''. [https://en.wikipedia.org/wiki/The_Harvard_Review_of_Philosophy The Harvard Review of Philosophy], Vol. 6, No. 1, [https://en.wikipedia.org/wiki/The_Hardest_Logic_Puzzle_Ever The Hardest Logic Puzzle Ever - Wikipedia]</ref>
* [[Landon Rabern]] ('''2009'''). ''On hitting all maximum cliques with an independent set''. [https://arxiv.org/abs/0907.3705 arXiv:0907.3705]
==2010 ...==
