default search action
Maria Axenovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j78]Maria Axenovich, Domagoj Bradac
, Lior Gishboliner
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. 33(3): 286-299 (2024) - [j77]Maria Axenovich:
A class of graphs of zero Turán density in a hypercube. Comb. Probab. Comput. 33(3): 404-410 (2024) - [j76]Maria Axenovich, António Girão, Lawrence Hollom, Julien Portier, Emil Powierski, Michael Savery, Youri Tamitegama, Leo Versteegen:
A note on interval colourings of graphs. Eur. J. Comb. 120: 103956 (2024) - [j75]Maria Axenovich, Christian Winter
Poset Ramsey Number R(P,Qn). II. N-Shaped Poset. Order 41(2): 401-418 (2024) - [j74]Maria Axenovich, Hanno Lefmann:
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations. SIAM J. Discret. Math. 38(1): 609-628 (2024) - 2023
- [j73]Maria Axenovich, Christian Winter
Poset Ramsey numbers: large Boolean lattice versus a fixed poset. Comb. Probab. Comput. 32(4): 638-653 (2023) - [j72]Maria Axenovich:
Extremal numbers for cycles in a hypercube. Discret. Appl. Math. 341: 1-3 (2023) - [j71]Maria Axenovich, Laurin Benz
Generalized Turán densities in the hypercube. Discret. Math. 346(2): 113238 (2023) - [j70]Maria Axenovich, Yair Caro, Raphael Yuster:
Sum-distinguishing number of sparse hypergraphs. Eur. J. Comb. 112: 103712 (2023) - [j69]Maria Axenovich
Interval colorings of graphs - Coordinated and unstable no-wait schedules. J. Graph Theory 104(4): 757-768 (2023) - 2022
- [j68]Maria Axenovich, António Girão, Richard Snyder, Lea Weber:
Strong complete minors in digraphs. Comb. Probab. Comput. 31(3): 489-506 (2022) - [j67]Maria Axenovich, Ryan R. Martin
Splits with forbidden subgraphs. Discret. Math. 345(2): 112689 (2022) - [j66]Maria Axenovich, Richard Snyder, Lea Weber
The Erdős-Hajnal conjecture for three colors and triangles. Discret. Math. 345(5): 112791 (2022) - [j65]Maria Axenovich, Annette Karrer:
High girth hypergraphs with unavoidable monochromatic or rainbow edges. Discuss. Math. Graph Theory 42(2): 471-484 (2022) - 2021
- [j64]Maria Axenovich, Izolda Gorgol
Induced Ramsey Number for a Star Versus a Fixed Graph. Electron. J. Comb. 28(1): 1 (2021) - [j63]Maria Axenovich, David Offner, Casey Tompkins:
Long path and cycle decompositions of even hypercubes. Eur. J. Comb. 95: 103320 (2021) - [j62]Maria Axenovich
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs. J. Graph Theory 97(1): 34-46 (2021) - [j61]Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder, Lea Weber:
Bipartite Independence Number in Graphs with Bounded Maximum Degree. SIAM J. Discret. Math. 35(2): 1136-1148 (2021) - 2020
- [j60]Maria Axenovich
On induced Ramsey numbers for multiple copies of graphs. J. Graph Theory 95(3): 398-409 (2020)
2010 – 2019
- 2019
- [j59]Maria Axenovich, Anika Kaufmann, Raphael Yuster:
Clumsy Packings of Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j58]Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt:
Planar Ramsey Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j57]Maria Axenovich, Philip Dörr, Jonathan Rollin
Induced and weak induced arboricities. Discret. Math. 342(2): 511-519 (2019) - [j56]Maria Axenovich, Mónika Csikós
Induced saturation of graphs. Discret. Math. 342(4): 1195-1212 (2019) - [j55]Maria Axenovich, András Gyárfás:
A note on Ramsey numbers for Berge-G hypergraphs. Discret. Math. 342(5): 1245-1252 (2019) - [j54]Maria Axenovich, Christian Winter
A Note on Saturation for Berge-G Hypergraphs. Graphs Comb. 35(4): 933-939 (2019) - [j53]Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic Colorings on the Integers. Integers 19: A18 (2019) - 2018
- [j52]Maria Axenovich, Jonathan Rollin
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. Comb. 38(5): 1021-1043 (2018) - [j51]Maria Axenovich, Daniel Gonçalves
The k-strong induced arboricity of a graph. Eur. J. Comb. 67: 1-20 (2018) - [j50]Maria Axenovich, John L. Goldwasser, Ryan Hansen
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87(4): 660-671 (2018) - [i10]Maria Axenovich, Philip Dörr, Jonathan Rollin, Torsten Ueckerdt:
Induced and Weak Induced Arboricities. CoRR abs/1803.02152 (2018) - [i9]Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt:
Planar Ramsey graphs. CoRR abs/1812.00832 (2018) - 2017
- [j49]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The chromatic number of ordered graphs with constrained conflict graphs. Australas. J Comb. 69: 74-104 (2017) - [j48]Maria Axenovich, Torsten Ueckerdt, Pascal Weiner
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. J. Graph Theory 85(3): 601-618 (2017) - [j47]Maria Axenovich, Jonathan Rollin
Conditions on Ramsey Nonequivalence. J. Graph Theory 86(2): 159-192 (2017) - [j46]Maria Axenovich, Stefan Walzer
Boolean Lattices: Ramsey Properties and Embeddings. Order 34(2): 287-298 (2017) - 2016
- [j45]Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - [j44]Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt:
Spectrum of Mixed Bi-uniform Hypergraphs. Graphs Comb. 32(2): 453-461 (2016) - [j43]Maria Axenovich, Torsten Ueckerdt:
Density of range capturing hypergraphs. J. Comput. Geom. 7(1): 1-21 (2016) - [i8]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic number of ordered graphs with forbidden ordered subgraphs. CoRR abs/1603.00312 (2016) - [i7]Maria Axenovich, Daniel Gonçalves
The k-strong induced arboricity of a graph. CoRR abs/1607.07174 (2016) - [i6]Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. CoRR abs/1610.01111 (2016) - 2015
- [j42]Maria Axenovich, Jonathan Rollin
Brooks type results for conflict-free colorings and {a, b}-factors in graphs. Discret. Math. 338(12): 2295-2301 (2015) - [i5]Maria Axenovich, Torsten Ueckerdt, Pascal Weiner:
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. CoRR abs/1507.02815 (2015) - 2014
- [j41]Stefan Walzer
Packing polyominoes clumsily. Comput. Geom. 47(1): 52-60 (2014) - [j40]Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi:
Multicolor Ramsey numbers for triple systems. Discret. Math. 322: 69-77 (2014) - [j39]Maria Axenovich, Ryan R. Martin
Twins in graphs. Eur. J. Comb. 39: 188-197 (2014) - [j38]Maria Axenovich, JiHyeok Choi, Michelle A. Lastrina, Tracy McKay, J. Smith, Brendon Stanton:
On the Chromatic Number of Subsets of the Euclidean Plane. Graphs Comb. 30(1): 71-81 (2014) - [i4]Maria Axenovich, Torsten Ueckerdt:
Density of range capturing hypergraphs. CoRR abs/1404.1298 (2014) - [i3]Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt:
Spectrum of mixed bi-uniform hypergraphs. CoRR abs/1407.1422 (2014) - 2013
- [j37]Maria Axenovich, Lale Özkahya:
On homometric sets in graphs. Australas. J Comb. 55: 175-188 (2013) - [j36]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161(10-11): 1363-1366 (2013) - [j35]Maria Axenovich, Georg Osang:
Unavoidable subtrees. Discret. Math. 313(8): 924-930 (2013) - [j34]Maria Axenovich, Yury Person
A regularity lemma and twins in words. J. Comb. Theory A 120(4): 733-743 (2013) - [j33]Maria Axenovich, Andrew Beveridge, Joan P. Hutchinson, Douglas B. West:
Visibility Number of Directed Graphs. SIAM J. Discret. Math. 27(3): 1429-1449 (2013) - 2012
- [j32]Maria Axenovich, Jacob Manske, Ryan R. Martin
Q 2-free Families in the Boolean Lattice. Order 29(1): 177-191 (2012) - [i2]Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. CoRR abs/1201.2551 (2012) - [i1]Maria Axenovich, Yury Person, Svetlana Puzynina:
A regularity lemma and twins in words. CoRR abs/1204.2180 (2012) - 2011
- [j31]Maria Axenovich, Joan P. Hutchinson, Michelle A. Lastrina:
List precoloring extension in planar graphs. Discret. Math. 311(12): 1046-1056 (2011) - [j30]Maria Axenovich, JiHyeok Choi:
A note on the monotonicity of mixed Ramsey numbers. Discret. Math. 311(17): 2020-2023 (2011) - [j29]Maria Axenovich, Lale Özkahya:
On homometric sets in graphs. Electron. Notes Discret. Math. 38: 83-86 (2011) - 2010
- [j28]Maria Axenovich, JiHyeok Choi:
On Colorings Avoiding a Rainbow Cycle and a Fixed Monochromatic Subgraph. Electron. J. Comb. 17(1) (2010) - [j27]Maria Axenovich, Sonali Roy:
On the structure of minimal winning coalitions in simple voting games. Soc. Choice Welf. 34(3): 429-440 (2010)
2000 – 2009
- 2009
- [j26]Chelsea Sackett, Maria Axenovich:
Avoiding rainbow induced subgraphs in edge-colorings. Australas. J Comb. 44: 287-296 (2009) - [j25]Maria Axenovich:
When do Three Longest Paths have a Common Vertex? Discret. Math. Algorithms Appl. 1(1): 115-120 (2009) - 2008
- [j24]Maria Axenovich, Ryan R. Martin:
Avoiding Rainbow Induced Subgraphs in Vertex-Colorings. Electron. J. Comb. 15(1) (2008) - [j23]Maria Axenovich, Perry Iverson:
Edge-colorings avoiding rainbow and monochromatic subgraphs. Discret. Math. 308(20): 4710-4723 (2008) - [j22]Maria Axenovich, André E. Kézdy
On the editing distance of graphs. J. Graph Theory 58(2): 123-138 (2008) - 2007
- [j21]Maria Axenovich, Ryan R. Martin:
On weighted Ramsey numbers. Australas. J Comb. 38: 179-194 (2007) - [j20]Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer:
Rainbows in the Hypercube. Graphs Comb. 23(2): 123-133 (2007) - [j19]Maria Axenovich, József Balogh:
Graphs Having Small Number of Sizes on Induced k-Subgraphs. SIAM J. Discret. Math. 21(1): 264-272 (2007) - 2006
- [j18]Maria Axenovich:
On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs. Electron. J. Comb. 13(1) (2006) - [j17]Maria Axenovich, Ryan R. Martin
A note on short cycles in a hypercube. Discret. Math. 306(18): 2212-2218 (2006) - [j16]Maria Axenovich, Ryan R. Martin
Sub-Ramsey Numbers for Arithmetic Progressions. Graphs Comb. 22(3): 297-309 (2006) - [j15]Maria Axenovich:
Avoiding Patterns in Matrices Via a Small Number of Changes. SIAM J. Discret. Math. 20(1): 49-54 (2006) - [j14]Maria Axenovich, Ryan R. Martin
On the Strong Chromatic Number of Graphs. SIAM J. Discret. Math. 20(3): 741-747 (2006) - 2005
- [j13]Maria Axenovich, Robert E. Jamison:
Canonical Pattern Ramsey Numbers. Graphs Comb. 21(2): 145-160 (2005) - 2004
- [j12]Maria Axenovich, Tao Jiang:
Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73 (2004) - [j11]Maria Axenovich, Dmitry Fon-Der-Flaass:
On Rainbow Arithmetic Progressions. Electron. J. Comb. 11(1) (2004) - [j10]Maria Axenovich, Tao Jiang, André Kündgen
Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1): 9-28 (2004) - 2003
- [j9]Maria Axenovich:
A Note on Graph Coloring Extensions and List-Colorings. Electron. J. Comb. 10 (2003) - [j8]Maria Axenovich, Tao Jiang, Zsolt Tuza:
Local Anti-Ramsey Numbers of Graphs. Comb. Probab. Comput. 12(5-6): 495-511 (2003) - [j7]Maria Axenovich, Zoltán Füredi:
Exact Bounds on the Sizes of Covering Codes. Des. Codes Cryptogr. 30(1): 21-38 (2003) - [j6]Maria Axenovich:
On multiple coverings of the infinite rectangular grid with balls of constant radius. Discret. Math. 268(1-3): 31-48 (2003) - 2001
- [j5]Maria Axenovich, André Kündgen
On a Generalized Anti-Ramsey Problem. Comb. 21(3): 335-349 (2001) - [j4]Maria Axenovich, Zoltán Füredi:
Embedding of graphs in two-irregular graphs. J. Graph Theory 36(2): 75-83 (2001) - 2000
- [j3]Maria Axenovich:
A generalized Ramsey problem. Discret. Math. 222(1-3): 247-249 (2000) - [j2]Maria Axenovich, Zoltán Füredi, Dhruv Mubayi:
On Generalized Ramsey Theory: The Bipartite Case. J. Comb. Theory B 79(1): 66-86 (2000)
1990 – 1999
- 1995
- [j1]Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
On set systems without weak 3-Delta-subsystems. Discret. Math. 138(1-3): 57-62 (1995)
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-10-07 21:23 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: