Peter Hamburger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Peter Hamburger has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Attila Pór
Department of Mathematics, Western Kentucky University, Bowling Green, USA
7 shared publications - Csaba Biró
Department of Mathematics, University of Louisville, Louisville, USA
6 shared publications - Alexandr Kostochka
University of Illinois at Urbana–Champaign, Urbana, USA
2 shared publications - William T. Trotter
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
2 shared publications - Christopher J. Stocker
DEPARTMENT OF MATHEMATICS UNIVERSITY OF ILLINOIS; URBANA; IL; 61801
1 shared publication - Matthew Walsh
Department of Mathematical Sciences Indiana University-Purdue University at Fort Wayne Fort Wayne, IN 46805
1 shared publication
Latest Publications
- 23 September 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (3) , 861-880
Forcing Posets with Large Dimension to Contain Large Standard Examples
- 23 September 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (3) , 861-880
Forcing Posets with Large Dimension to Contain Large Standard Examples
- Open Access
Forcing Posets with Large Dimension to Contain Large Standard Examples
The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this inequality is tight when $P$ contains the standard example $S_n$. However, there are posets with large dimension that do not contain the standard example $S_2$. Moreover, for each fixed $d\ge2$, if $P$ is a poset with $|P|\le 2n+1$ and $P$ does not contain the standard example $S_d$, then $\dim(P)=o(n)$. Also, for large $n$, there is a poset $P$ with $|P|=2n$ and $\dim(P)\ge (1-o(1))n$ such that the largest $d$ so that $P$ contains the standard example $S_d$ is $o(n)$. In this paper, we will show that for every integer $c\ge1$, there is an integer $f(c)=O(c^2)$ so that for large enough $n$, if $P$ is a poset with $|P|\le 2n+1$ and $\dim(P)\ge n-c$, then $P$ contains a standard example $S_d$ with $d\ge n-f(c)$. From below, we show that $f(c)=\Omega(c^{4/3})$. On the other hand, we also prove an analogous result for fractional dimension, and in this setting $f(c)$ is linear in $c$. Here the result is best possible up to the value of the multiplicative constant.Open AccessForcing Posets with Large Dimension to Contain Large Standard Examples
The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this inequality is tight when $P$ contains the standard example $S_n$. However, there are posets with large dimension that do not contain the standard example $S_2$. Moreover, for each fixed $d\ge2$, if $P$ is a poset with $|P|\le 2n+1$ and $P$ does not contain the standard example $S_d$, then $\dim(P)=o(n)$. Also, for large $n$, there is a poset $P$ with $|P|=2n$ and $\dim(P)\ge (1-o(1))n$ such that the largest $d$ so that $P$ contains the standard example $S_d$ is $o(n)$. In this paper, we will show that for every integer $c\ge1$, there is an integer $f(c)=O(c^2)$ so that for large enough $n$, if $P$ is a poset with $|P|\le 2n+1$ and $\dim(P)\ge n-c$, then $P$ contains a standard example $S_d$ with $d\ge n-f(c)$. From below, we show that $f(c)=\Omega(c^{4/3})$. On the other hand, we also prove an analogous result for fractional dimension, and in this setting $f(c)$ is linear in $c$. Here the result is best possible up to the value of the multiplicative constant. - 28 June 2014
- Published by Springer Nature in Order
- Vol. 32 (2) , 293-299
Standard Examples as Subposets of Posets
- 28 June 2014
- Published by Springer Nature in Order
- Vol. 32 (2) , 293-299
Standard Examples as Subposets of Posets
- Open Access
The proof of the removable pair conjecture for fractional dimension
In 1971 Trotter conjectured that every finite poset on at least $3$ points has a pair whose removal does not decrease the dimension by more than $1$. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they made a similar conjecture for fractional dimension. This paper settles this latter conjecture.Open AccessThe proof of the removable pair conjecture for fractional dimension
In 1971 Trotter conjectured that every finite poset on at least $3$ points has a pair whose removal does not decrease the dimension by more than $1$. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they made a similar conjecture for fractional dimension. This paper settles this latter conjecture. - Open Access
- 13 January 2014
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 21 (1) , P1.63
The Proof of the Removable Pair Conjecture for Fractional Dimension
In 1971 Trotter (or Bogart and Trotter) conjectured that every finite poset on at least 3 points has a pair whose removal does not decrease the dimension by more than 1. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they made a similar conjecture for fractional dimension. This paper settles this latter conjecture.
- 13 January 2014
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 21 (1) , P1.63
Open AccessThe Proof of the Removable Pair Conjecture for Fractional Dimension
In 1971 Trotter (or Bogart and Trotter) conjectured that every finite poset on at least 3 points has a pair whose removal does not decrease the dimension by more than 1. In 1992 Brightwell and Scheinerman introduced fractional dimension of posets, and they made a similar conjecture for fractional dimension. This paper settles this latter conjecture.
- Open Access
Standard Examples as Subposets of Posets
We prove that a poset with no induced subposet $S_k$ (for fixed $k\geq 3$) must have dimension that is sublinear in terms of the number of elements.Open AccessStandard Examples as Subposets of Posets
We prove that a poset with no induced subposet $S_k$ (for fixed $k\geq 3$) must have dimension that is sublinear in terms of the number of elements. - 4 December 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (2) , 222-235
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
- 4 December 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (2) , 222-235
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
- 1 January 2011
- Published by Springer Nature in Combinatorica
- Vol. 31 (1) , 55-66
Destroying cycles in digraphs
- 1 January 2011
- Published by Springer Nature in Combinatorica
- Vol. 31 (1) , 55-66
Destroying cycles in digraphs
- 23 October 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 57 (1) , 55-64
Onk-detour subgraphs of hypercubes
- 23 October 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 57 (1) , 55-64
Onk-detour subgraphs of hypercubes
- 1 June 2007
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (11) , 1384-1394
Routing sets in the integer lattice
- 1 June 2007
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (11) , 1384-1394
Routing sets in the integer lattice