Adam S. Jobson

Generating author description...

All published works

Action	Title	Year	Authors
+	Systems of Overlap Representation for Families of Intervals	2022	Adam S. Jobson André E. Kézdy Kevin G. Milans Douglas B. West D. Jacob Wildstrom
+ PDF Chat	Eckhoff's Problem on Convex Sets in the Plane	2021	Adam S. Jobson André E. Kézdy Jenö Lehel
+ PDF Chat	The Szemerédi–Petruska conjecture for a few small values	2021	Adam S. Jobson André E. Kézdy Jenö Lehel
+ PDF Chat	All Minor-Minimal Apex Obstructions with Connectivity Two	2021	Adam S. Jobson André E. Kézdy
+	Minimal 2-connected graphs satisfying the even cut condition	2020	Adam S. Jobson André E. Kézdy Jenö Lehel
+	The Szemer\'edi-Petruska conjecture for a few small values	2020	Adam S. Jobson André E. Kézdy Jenö Lehel
+	Petruska’s question on planar convex sets	2020	Adam S. Jobson André E. Kézdy Jenö Lehel Timothy J. Pervenecki Gézá Tóth
+	The Szemerédi-Petruska conjecture for a few small values	2020	Adam S. Jobson André E. Kézdy Jenö Lehel
+	Petruska's question on planar convex sets	2019	Adam S. Jobson André E. Kézdy Jenö Lehel Timothy J. Pervenecki Gézá Tóth
+	On a conjecture of Szemer\'edi and Petruska	2019	Adam S. Jobson André E. Kézdy Tim Pervenecki
+	On a conjecture of Szemerédi and Petruska	2019	Adam S. Jobson André E. Kézdy Tim Pervenecki
+	Petruska's question on planar convex sets	2019	Adam S. Jobson André E. Kézdy Jenö Lehel Timothy J. Pervenecki Gézá Tóth
+	On a conjecture of Szemerédi and Petruska	2019	Adam S. Jobson André E. Kézdy Tim Pervenecki
+	All minor-minimal apex obstructions with connectivity two	2018	Adam S. Jobson André E. Kézdy
+	The path-pairability number of products of stars	2018	Adam S. Jobson André E. Kézdy Jenö Lehel Gábor Mészáros
+	The minimum size of graphs satisfying cut conditions	2017	Adam S. Jobson André E. Kézdy Jenö Lehel
+	Escaping from the corner of a grid by edge disjoint paths	2017	Adam S. Jobson André E. Kézdy Jenő Lehel
+	Escaping from a quadrant of the $6\times 6$ grid by edge disjoint paths	2017	Adam S. Jobson André E. Kézdy Jenő Lehel
+	The $6\times 6$ grid is $4$-path-pairable	2017	Adam S. Jobson André E. Kézdy Jenő Lehel
+	Detour trees	2016	Adam S. Jobson André E. Kézdy Jenö Lehel Susan C. White
+	Variations on Narrow Dots-and-Boxes and Dots-and-Triangles	2015	Adam S. Jobson Levi Sledd Susan C. White D. Jacob Wildstrom
+	Variations on Narrow Dots-and-Boxes and Dots-and-Triangles	2015	Adam S. Jobson Levi Sledd Susan C. White D. Jacob Wildstrom
+	Connected matchings in chordal bipartite graphs	2014	Adam S. Jobson André E. Kézdy Susan C. White
+	Stack Domination Density	2012	Timothy Brauch Paul Horn Adam S. Jobson D. Jacob Wildstrom
+	Avoiding, pretending, and querying : three combinatorial problems.	2011	Adam S. Jobson
+ PDF Chat	Ramsey functions for quasi-progressions with large diameter	2011	Adam S. Jobson André E. Kézdy Hunter S. Snevily Susan C. White

Common Coauthors

Coauthor	Papers Together
André E. Kézdy	22
Jenő Lehel	14
Susan C. White	5
D. Jacob Wildstrom	4
Tim Pervenecki	3
Timothy J. Pervenecki	3
Gézá Tóth	3
Levi Sledd	2
Douglas B. West	1
Timothy Brauch	1
Hunter S. Snevily	1
Kevin G. Milans	1
Paul Horn	1
Gábor Mészáros	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Upper bound on the order of τ-critical hypergraphs	1982	András Gyárfás Jenö Lehel Zs. Tuza	6
+	Critical hypergraphs and intersecting set-pair systems	1985	Źsolt Tuza	6
+	A combinatorial problem	1946	de Ng Dick Bruijn	4
+ PDF Chat	A Theorem on <i>k</i>-Saturated Graphs	1965	A. Hajnal	3
+	Petruska’s question on planar convex sets	2020	Adam S. Jobson André E. Kézdy Jenö Lehel Timothy J. Pervenecki Gézá Tóth	3
+	Note on terminal-pairability in complete grid graphs	2017	Ervin Győri Tamás Róbert Mezei Gábor Mészáros	3
+	Order plus size of τ‐critical graphs	2020	András Gyárfás Jenö Lehel	2
+	d-Collapsing and nerves of families of convex sets	1975	Gerd Wegner	2
+	Computing excluded minors	2008	Isolde Adler Martin Grohe Stephan Kreutzer	2
+ PDF Chat	Obtaining a Planar Graph by Vertex Deletion	2011	Dániel Marx Ildikó Schlotter	2
+ PDF Chat	On Certain Intersection Properties of Convex Sets	1951	Victor Klee	2
+ PDF Chat	Some of My Favorite Problems in Ramsey Theory	2006	Ronald Graham	2
+ PDF Chat	Ramsey Theory on the Integers	2003	Bruce Landman Aaron Robertson	2
+	Helly, Radon, and Carathéodory Type Theorems	1993	Jürgen Eckhoff	2
+	Terminal-Pairability in Complete Graphs	2016	Ervin Györi Tamás Róbert Mezei Gábor Mészáros	2
+	Ramsey Functions for Quasi-Progressions	1998	Bruce Landman	2
+	A generalization of carathéodory's theorem	1982	Imre Bárány	2
+	On a Variant of Van Der Waerden's Theorem	2010	Sujith Vijay	2
+	Quasi-progressions and descending waves	1990	Tom C. Brown Péter L. Erdős Allen R. Freedman	2
+	Alternating cycle-free matchings	1990	H. M�ller	1
+	SOME UNSOLVED PROBLEMS IN GRAPH THEORY	1968	V. G. Vizing	1
+	Characterization off-vectors of families of convex sets inR d Part I: Necessity of Eckhoff’s conditions	1984	Gil Kalai	1
+	Dually Chordal Graphs	1998	Andreas Brandstädt Feodor F. Dragan Victor Chepoi Vitaly Voloshin	1
+	On Representatives of Subsets	1935	P. Hall	1
+	Graph Minors. XX. Wagner's conjecture	2004	Neil Robertson Paul Seymour	1
+	Dominating sets in plane triangulations	2010	Erika L. C. King Michael J. Pelsmajer	1
+	A notion of cross-perfect bipartite graphs	2003	Milind Dawande	1
+	On the domination of the products of graphs II: Trees	1986	Michael S. Jacobson Lael F. Kinch	1
+ PDF Chat	Bemerkung über die harmonische Reihe	1915	Leopold Theisinger	1
+	The interchange graph of a finite graph	1965	A. C. M. van Rooij Herbert S. Wilf	1
+	Research Problems from the BCC21	2009	Peter J‎. Cameron	1
+	None	2008	Mary Cryan Martin Dyer Haiko Müller Leen Stougie	1
+ PDF Chat	Combinatorial approach to the interpolation method and scaling limits in sparse random graphs	2010	Mohsen Bayati David Gamarnik Prasad Tetali	1
+	Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs	1998	David Fisher Patricia A. McKenna Elizabeth D. Boyer	1
+	On a combinatorial problem	1948	FA Dick de Bruijn P. Erdős	1
+	On the correspondence between tree representations of chordal and dually chordal graphs	2013	Pablo De Caria Marisa Gutiérrez	1
+ PDF Chat	On minimal vertex separators of dually chordal graphs: Properties and characterizations	2012	Pablo De Caria Marisa Gutiérrez	1
+	Computing and counting longest paths on circular-arc graphs in polynomial time	2012	George B. Mertzios Ivona Bezáková	1
+	On the ?log rank?-conjecture in communication complexity	1995	Ran Raz Boris Spieker	1
+ PDF Chat	Special issue on Euler and Venn Diagrams: Guest Editors’ introduction	2015	Jim Burton Gem Stapleton	1
+ PDF Chat	Bisection (Band)Width of Product Networks with Application to Data Centers	2014	Jordi Arjona Aroca Antonio Fernández Anta	1
+ PDF Chat	Ramsey functions for quasi-progressions with large diameter	2011	Adam S. Jobson André E. Kézdy Hunter S. Snevily Susan C. White	1
+ PDF Chat	On Detours in Graphs<sup>1</sup>	1968	Sanjiv Kapoor Hudson V. Kronk Don R. Lick	1
+ PDF Chat	Some of my favorite problems in Ramsey theory	2012	Ron Graham	1
+ PDF Chat	Six variations on a theme: almost planar graphs	2017	Max Lipton Eoin Mackall Thomas W. Mattman Mike Pierce Samantha Robinson Jeremy Thomas Ilan Weinschelbaum	1
+	The minimum size of graphs satisfying cut conditions	2017	Adam S. Jobson André E. Kézdy Jenö Lehel	1
+	Connected Matchings	2003	Kathie Cameron	1
+	On a conjecture of Szemer\'edi and Petruska	2019	Adam S. Jobson André E. Kézdy Tim Pervenecki	1
+ PDF Chat	The rank of random graphs	2008	Kevin Costello Van H. Vu	1
+	On a conjecture of Szemerédi and Petruska	2019	Adam S. Jobson André E. Kézdy Tim Pervenecki	1