Cory Palmer

Orcid: 0000-0002-6718-5762

According to our database1, Cory Palmer authored at least 35 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deranged Matchings: Proofs and Conjectures.
Am. Math. Mon., 2024

A generalization of diversity for intersecting families.
Eur. J. Comb., 2024

2023
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza.
J. Graph Theory, October, 2023

2022
Hypergraph Based Berge Hypergraphs.
Graphs Comb., 2022

Turán numbers for hypergraph star forests.
Eur. J. Comb., 2022

Some exact results for generalized Turán problems.
Eur. J. Comb., 2022

Generalized Rainbow Turán Numbers.
Electron. J. Comb., 2022

2021
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree.
SIAM J. Discret. Math., 2021

On supersaturation and stability for generalized Turán problems.
J. Graph Theory, 2021

Rainbow cycles versus rainbow paths.
Australas. J Comb., 2021

At most 3.55<sup>n</sup> stable matchings.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
General lemmas for Berge-Turán hypergraph problems.
Eur. J. Comb., 2020

At most 4.47<sup>n</sup> stable matchings.
CoRR, 2020

2019
Counting copies of a fixed subgraph in F-free graphs.
Eur. J. Comb., 2019

Turán numbers for Berge-hypergraphs and related extremal problems.
Discret. Math., 2019

On the Weight of Berge-F-Free Hypergraphs.
Electron. J. Comb., 2019

2018
On the Number of Cycles in a Graph with Restricted Cycle Lengths.
SIAM J. Discret. Math., 2018

Identifying defective sets using queries of small size.
Discret. Math., 2018

2017
Extremal Results for Berge Hypergraphs.
SIAM J. Discret. Math., 2017

Rainbow Turán Problems for Paths and Forests of Stars.
Electron. J. Comb., 2017

2016
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett., 2016

Rainbow copies of C<sub>4</sub> in edge-colored hypercubes.
Discret. Appl. Math., 2016

2013
On the Tree Packing Conjecture.
SIAM J. Discret. Math., 2013

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.
Graphs Comb., 2013

Saturating Sperner Families.
Graphs Comb., 2013

On the Turán Number of Forests.
Electron. J. Comb., 2013

The Biased Odd Cycle Game.
Electron. J. Comb., 2013

2012
Almost Intersecting Families of Sets.
SIAM J. Discret. Math., 2012

Generalizations of the tree packing conjecture.
Discuss. Math. Graph Theory, 2012

Irregular labelings of circulant graphs.
Discret. Math., 2012

Two-Part Set Systems.
Electron. J. Comb., 2012

2010
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math., 2010

2009
A new type of edge-derived vertex coloring.
Discret. Math., 2009

2008
The Unbalance of Set Systems.
Graphs Comb., 2008

General neighbour-distinguishing index of a graph.
Discret. Math., 2008


  Loading...