#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2007

2018

- This year (4)
- Last 5 years (18)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Method

#### Organism

Learn More

- Dániel Gerbner, Cory Palmer
- SIAM J. Discrete Math.
- 2017

Let G be a graph and H be a hypergraph both on the same vertex set. We say that a hypergraph H is a Berge-G if there is a bijection f : E(G) → E(H) such that for e ∈ E(G) we have e ⊂ f(e). This… (More)

- Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
- Discrete Mathematics
- 2008

It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of their incident edges.… (More)

- Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
- Graphs and Combinatorics
- 2013

A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one cannot add any set to F such that property P is still satisfied by the resulting family. We address the problem… (More)

- Ervin Györi, Cory Palmer
- Discrete Mathematics
- 2009

We study the minimum number of weights assigned to the edges of a graph G with no component K2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best… (More)

- Laszlo Négyessy, Emese Pálfi, +5 authors Anna W. Roe
- The Journal of comparative neurology
- 2013

To understand manual tactile functions in primates, it is essential to explore the interactions between the finger pad representations in somatosensory cortex. To this end, we used optical imaging… (More)

- Nathan Lemons, Cory Palmer
- Graphs and Combinatorics
- 2008

The unbalance of an intersecting family F is defined as |F|−d(F), where d(F) is the maximum degree of F ; the max |{F ∈ F : x ∈ F}| over all vertices x. We show that the unbalance of a k-uniform… (More)

- Hong Liu, Bernard Lidický, Cory Palmer
- Electr. J. Comb.
- 2013

The Turán number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turán number and find the unique extremal graph… (More)

- József Balogh, Cory Palmer
- SIAM J. Discrete Math.
- 2013

The Gyárfás tree packing conjecture states that any set of n−1 trees T1, T2, . . . , Tn−1 such that Ti has n− i+ 1 vertices pack into Kn (for n large enough). We show that t = 1 10n 1/4 trees T1, T2,… (More)

- Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós
- SIAM J. Discrete Math.
- 2018