default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCory Palmer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Van Magnan, Cory Palmer
, Ryan Wood:
A generalization of diversity for intersecting families. Eur. J. Comb. 122: 104041 (2024)- [j32]Daniel Johnston, P. Mark Kayll, Cory Palmer:
Deranged Matchings: Proofs and Conjectures. Am. Math. Mon. 131(2): 95-111 (2024) - 2023
- [j31]Cory Palmer, Balázs Patkós:
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza. J. Graph Theory 104(2): 440-445 (2023) - 2022
- [j30]Dániel Gerbner, Tamás Mészáros, Abhishek Methuku, Cory Palmer:
Generalized Rainbow Turán Numbers. Electron. J. Comb. 29(2) (2022) - [j29]Omid Khormali, Cory Palmer:
Turán numbers for hypergraph star forests. Eur. J. Comb. 102: 103506 (2022) - [j28]Dániel Gerbner, Cory Palmer:
Some exact results for generalized Turán problems. Eur. J. Comb. 103: 103519 (2022) - [j27]Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, Cory Palmer:
Hypergraph Based Berge Hypergraphs. Graphs Comb. 38(1): 11 (2022) - 2021
- [j26]Anastasia Halfpap, Cory Palmer:
Rainbow cycles versus rainbow paths. Australas. J Comb. 81: 152-169 (2021) - [j25]Anastasia Halfpap, Cory Palmer:
On supersaturation and stability for generalized Turán problems. J. Graph Theory 97(2): 232-240 (2021) - [j24]József Balogh, Nathan Lemons, Cory Palmer:
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree. SIAM J. Discret. Math. 35(3): 1525-1535 (2021) - [c1]Cory Palmer, Dömötör Pálvölgyi:
At most 3.55n stable matchings. FOCS 2021: 217-227 - 2020
- [j23]Dániel Gerbner, Abhishek Methuku, Cory Palmer:
General lemmas for Berge-Turán hypergraph problems. Eur. J. Comb. 86: 103082 (2020) - [i1]Cory Palmer, Dömötör Pálvölgyi:
At most 4.47n stable matchings. CoRR abs/2011.00915 (2020)
2010 – 2019
- 2019
- [j22]Sean English, Dániel Gerbner, Abhishek Methuku, Cory Palmer:
On the Weight of Berge-F-Free Hypergraphs. Electron. J. Comb. 26(4): 4 (2019) - [j21]Cory Palmer, Michael Tait, Craig Timmons, Zsolt Adam Wagner:
Turán numbers for Berge-hypergraphs and related extremal problems. Discret. Math. 342(6): 1553-1563 (2019) - [j20]Dániel Gerbner, Cory Palmer:
Counting copies of a fixed subgraph in F-free graphs. Eur. J. Comb. 82 (2019) - 2018
- [j19]Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu:
Identifying defective sets using queries of small size. Discret. Math. 341(1): 143-150 (2018) - [j18]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós:
On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM J. Discret. Math. 32(1): 266-279 (2018) - 2017
- [j17]Daniel Johnston, Cory Palmer, Amites Sarkar:
Rainbow Turán Problems for Paths and Forests of Stars. Electron. J. Comb. 24(1): 1 (2017) - [j16]Dániel Gerbner, Cory Palmer:
Extremal Results for Berge Hypergraphs. SIAM J. Discret. Math. 31(4): 2314-2327 (2017) - 2016
- [j15]József Balogh, Michelle Delcourt, Bernard Lidický, Cory Palmer:
Rainbow copies of C4 in edge-colored hypercubes. Discret. Appl. Math. 210: 35-37 (2016) - [j14]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi:
Topological orderings of weighted directed acyclic graphs. Inf. Process. Lett. 116(9): 564-568 (2016) - 2013
- [j13]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j12]Hong Liu, Bernard Lidický, Cory Palmer:
On the Turán Number of Forests. Electron. J. Comb. 20(2): 62 (2013) - [j11]Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi:
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29(3): 489-498 (2013) - [j10]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. Graphs Comb. 29(5): 1355-1364 (2013) - [j9]József Balogh, Cory Palmer:
On the Tree Packing Conjecture. SIAM J. Discret. Math. 27(4): 1995-2006 (2013) - 2012
- [j8]Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós:
Two-Part Set Systems. Electron. J. Comb. 19(1): 52 (2012) - [j7]Marcin Anholcer, Cory Palmer:
Irregular labelings of circulant graphs. Discret. Math. 312(23): 3461-3466 (2012) - [j6]Dániel Gerbner, Balázs Keszegh, Cory Palmer:
Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory 32(3): 569-582 (2012) - [j5]Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi:
Almost Intersecting Families of Sets. SIAM J. Discret. Math. 26(4): 1657-1669 (2012) - 2010
- [j4]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310(1): 21-30 (2010)
2000 – 2009
- 2009
- [j3]Ervin Györi, Cory Palmer:
A new type of edge-derived vertex coloring. Discret. Math. 309(22): 6344-6352 (2009) - 2008
- [j2]Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak:
General neighbour-distinguishing index of a graph. Discret. Math. 308(5-6): 827-831 (2008) - [j1]Nathan Lemons, Cory Palmer:
The Unbalance of Set Systems. Graphs Comb. 24(4): 361-365 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
