default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiana Yepremyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan:
Rainbow subdivisions of cliques. Random Struct. Algorithms 64(3): 625-644 (2024)- [i8]Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan:
Longest cycles in vertex-transitive and highly connected graphs. CoRR abs/2408.04618 (2024) - 2023
- [j15]Tao Jiang, Abhishek Methuku, Liana Yepremyan:
Rainbow Turán number of clique subdivisions. Eur. J. Comb. 110: 103675 (2023) - [j14]Tao Jiang, Jie Ma, Liana Yepremyan:
Linear cycles of consecutive lengths. J. Comb. Theory B 163: 1-24 (2023) - 2022
- [j13]Tao Jiang, Jie Ma, Liana Yepremyan:
On Turán exponents of bipartite graphs. Comb. Probab. Comput. 31(2): 333-344 (2022) - 2021
- [j12]Nina Kamcev
, Anita Liebenau, David R. Wood, Liana Yepremyan:
The Size Ramsey Number of Graphs with Bounded Treewidth. SIAM J. Discret. Math. 35(1): 281-293 (2021) - [i7]Aditya Potukuchi, Liana Yepremyan:
Enumerating independent sets in Abelian Cayley graphs. CoRR abs/2109.06152 (2021) - 2020
- [j11]Peter Keevash, Liana Yepremyan:
On the number of symbols that forces a transversal. Comb. Probab. Comput. 29(2): 234-240 (2020) - [j10]Tao Jiang, Liana Yepremyan:
Supersaturation of even linear cycles in linear hypergraphs. Comb. Probab. Comput. 29(5): 698-721 (2020) - [j9]Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan:
Rainbow factors in hypergraphs. J. Comb. Theory A 172: 105184 (2020) - [i6]Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan:
Notes on Tree- and Path-chromatic Number. CoRR abs/2002.05363 (2020)
2010 – 2019
- 2019
- [j8]Adam Bene Watts, Sergey Norin, Liana Yepremyan:
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians. Comb. 39(5): 1149-1171 (2019) - [i5]Nina Kamcev, Anita Liebenau, David Wood, Liana Yepremyan:
The size Ramsey number of graphs with bounded treewidth. CoRR abs/1906.09185 (2019) - 2018
- [j7]Sergey Norin, Liana Yepremyan:
Turán numbers of extensions. J. Comb. Theory A 155: 476-492 (2018) - [j6]Zdenek Dvorák, Liana Yepremyan:
Complete graph immersions and minimum degree. J. Graph Theory 88(1): 211-221 (2018) - [j5]Peter Keevash, Liana Yepremyan:
Rainbow Matchings in Properly Colored Multigraphs. SIAM J. Discret. Math. 32(3): 1577-1584 (2018) - [i4]Peter Keevash, Liana Yepremyan:
On the number of symbols that forces a transversal. CoRR abs/1805.10911 (2018) - 2017
- [j4]Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan:
The extremal function for disconnected minors. J. Comb. Theory B 126: 162-174 (2017) - [j3]Sergey Norin, Liana Yepremyan:
Turán number of generalized triangles. J. Comb. Theory A 146: 312-343 (2017) - [i3]Peter Keevash, Liana Yepremyan:
Rainbow matchings in properly-coloured multigraphs. CoRR abs/1710.03041 (2017) - 2015
- [j2]Sergey Norin, Liana Yepremyan:
Sparse halves in dense triangle-free graphs. J. Comb. Theory B 115: 1-25 (2015) - [i2]Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz:
The Characterization of planar, 4-connected, K_{2, 5}-minor-free graphs. CoRR abs/1507.06800 (2015) - 2013
- [j1]Sergey Norin, Liana Yepremyan:
Sparse halves in dense triangle-free graphs. Electron. Notes Discret. Math. 43: 271-278 (2013) - 2011
- [i1]Petros A. Petrosyan, Hrant Khachatrian, Liana Yepremyan, Hovhannes Tananyan:
Interval edge-colorings of graph products. CoRR abs/1110.1165 (2011)
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 2024-09-30 00:57 CEST 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:
