Dr. John Maharry

OSU-Marion Mathematics

Department of Mathematics
The Ohio State University
Marion Campus
Office: Morrill Hall 370

phone (740)725-6166
e-mail: maharry@math.ohio-state.edu


Schedule for Spring 2009
Monday
Tuesday
Wednesday
Thursday
Friday
 

Math 152E

10:30-12:45

  

Math 152E

10:30-12:45

  
 
Office Hours in DC 219 Classroom
 
Office Hours in DC 219 Classroom
 
 

Math 150E

1:30-3:45

Math 150E

1:30-3:45

  


Mathematical Sites

Research

Teaching

Problems and Puzzles

Other Math Links

Q13,3 Graph

 

Robertson Graph

Publications

In Print

  1. Boehme, Thomas; Kawarabayashi, Ken-ichi: Maharry,John; Mohar, Bojan, Linear Connectivity Forces Large Complete Bipartite Minors, J.Combin. Theory, Ser. B., 99 (2009), no. 3, 557-582.
  2. Maharry, John, An excluded minor theorem for the Octahedron plus an edge, J. Graph Theory 57 (2008), no. 2, 124-130.
  3. de Klerk, E. ; Maharry, J. ; Pasechnik, D.V.; Richter, R.B.; Salazar, G, Improved bounds for the crossing numbers of Km,n and Kn, SIAM J. Discrete Math. 20 (2006), no.1, 189-202.
  4. Boehme, Thomas; Maharry,John; Mohar, Bojan Ka,k-minors in graphs of bounded tree-width. J. Combin. Theory Ser. B 86 (2002), no.1, 133-147.
  5. Maharry, John A characterization of graphs with no cube minor. J. Combin. Theory Ser. B 80 (2000), no. 2, 179-201.
  6. Sanders, Daniel P.; Maharry, John On simultaneous colorings of embedded graphs. Discrete Math. 224 (2000), no. 1-3, 207-214. 05C15 (05C10)
  7. Maharry, John An excluded minor theorem for the octahedron. J. Graph Theory 31 (1999), no. 2, 95-100.
  8. Maharry, John A splitter for graphs with no Petersen family minor. J. Combin. Theory Ser. B 72 (1998), no. 1, 136-139

Submitted

  1. Kawarabayashi, Ken-ichi, Maharry, John, Minors in Large 5-Connected Non-Planar Graphs.Submitted to Journal of Graph Theory
  2. Boehme, Thomas; Kawarabayashi, Ken-ichi; Maharry,John; Mohar, Bojan, K3,k-minors in large graphs , Submitted to JCTB
  3. Maharry, John, Three Excluded Minor Structure Theorems, submitted to the Electronic Journal of Combinatorics

In Preparation .

  1. Maharry, John; Slilaty, Daniel, Projective Planar Graphs with no K3,4-minor, in preparation.
  2. Maharry, John; Slilaty, Daniel, An Analogue of Hall's Theorem for the Projective Plane, in preparation.
  3. Kawarabayashi, Ken-ichi, Maharry, John, Unavoidable 5-connected minors in large 5-connected graphs, in preparation

Petersen

WebSite

Graph of this Web Site


Aleph-null bottles of beer on the wall,
Aleph-null bottles of beer,
You take one down, and pass it around,
Aleph-null bottles of beer on the wall.

Graph Theorems in Song Lyrics by Cat Stevens

Last stanza of Cat Stevens - "Sitting"

Oh life is like a maze of doors and they all open from the
side you're on
Just keep on pushing hard boy, try as you may
You're going to wind up where you started from
You're going to wind up where you started from

Graph Theorem: In a random walk of 'k' steps in a directed graph on 'n' vertices, the probabilty that the walk returns to the initial vertex approaches one as 'k' approaches infinity.

Cat Stevens forgot the condition that the graph must be strongly connected, but I guess that would have been hard to fit into the lyrics.

 

Nothing is better than eternal happiness.
A ham sandwich is better than nothing.
Therefore...

Always remember that half the people you know are below average.

There are exactly three false statements in this box. Find them:

1. 2+3=6
2. The square root of 2 is irrational.
3. 37 is a prime number.
4. 107 (mod 5) = 3