Mark J. Logan

According to our database, Mark J. Logan authored at least 6 papers between 2002 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

Methods for nesting rank 3 normalized matching rank-unimodal posets.

Tim Hsu, Mark J. Logan, Shahriar Shahriari

Discret. Math., 2009

2006

The generalized Füredi conjecture holds for finite linear lattices.

Tim Hsu, Mark J. Logan, Shahriar Shahriari

Discret. Math., 2006

2004

A new matching property for posets and existence of disjoint chains.

Mark J. Logan, Shahriar Shahriari

J. Comb. Theory, Ser. A, 2004

2003

Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size.

Tim Hsu, Mark J. Logan, Shahriar Shahriari, Christopher Towse

Eur. J. Comb., 2003

2002

Partitioning the Boolean Lattice into Chains of Large Minimum Size.

Tim Hsu, Mark J. Logan, Shahriar Shahriari, Christopher Towse

J. Comb. Theory, Ser. A, 2002

Sperner theory in a difference of Boolean lattices.

Mark J. Logan

Discret. Math., 2002