#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1992

2018

- This year (2)
- Last 5 years (6)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka
- Electr. J. Comb.
- 2007

Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if Î± â‰¥ 0.35312, then each n-vertexâ€¦ (More)

- Lowell W. Beineke, Peter Hamburger, Wayne Goddard
- Discrete Mathematics
- 1994

A graph G is said to be packable by the graph F if its edges can be partitioned into copies of F. It is called randomly packable if what remains after deletion of the edges of a proper subgraph thatâ€¦ (More)

- Peter Hamburger, Attila PÃ³r, Matt Walsh
- SIAM J. Discrete Math.
- 2009

The Kneser graph Kn:k for positive integers n â‰¥ k has as its vertex set the k-element subsets of some n-set, with disjoint sets being adjacent. Every finite simple graph can be found as an inducedâ€¦ (More)

- Alexandr V. Kostochka, Christopher Stocker, Peter Hamburger
- Journal of Graph Theory
- 2013

Two n-vertex hypergraphs G and H pack, if there is a bijection f : V (G) â†’ V (H ) such that for every edge e âˆˆ E (G), the set {f (v ) : v âˆˆ e} is not an edge in H. Extending a theorem by BollobÃ¡s andâ€¦ (More)

- Csaba BirÃ³, Peter Hamburger, Attila PÃ³r, William T. Trotter
- Graphs and Combinatorics
- 2016

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 | â‰¤ 2n+ 1 is n,â€¦ (More)

- Molly Dunkum, Peter Hamburger, Attila PÃ³r
- Combinatorica
- 2011

- Kiran B. Chilakamarri, Peter Hamburger, Raymond E. Pippert
- J. Comb. Theory, Ser. B
- 1996

- Peter Hamburger, Alexandr V. Kostochka, Alexander Sidorenko
- Journal of Graph Theory
- 1999

A minimal detour subgraph of the n-dimensional cube is a spanning subgraph G of Qn having the property that, for vertices x, y of Qn, distances are related by dG(x, y) â‰¤ dQn(x, y)+2. For a spanningâ€¦ (More)

- Agnes E Hamburger, Anthony P. West, Zsuzsa A Hamburger, Peter Hamburger, Pamela J. Bjorkman
- Journal of molecular biology
- 2005

Ferritins are iron storage proteins made of 24 subunits forming a hollow spherical shell. Vertebrate ferritins contain varying ratios of heavy (H) and light (L) chains; however, known ferritinâ€¦ (More)

- Noga Alon, Peter Hamburger, Alexandr V. Kostochka
- Eur. J. Comb.
- 1999

The edge-integrity of a graph G is I 0(G) := minfjSj + m(G S) : S Eg; where m(H) denotes the maximum order of a component of H: A graph G is called honest if its edge-integrity is the maximumâ€¦ (More)