Maria Axenovich

Orcid: 0000-0002-8843-9557

According to our database1, Maria Axenovich authored at least 74 papers between 1995 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
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations.
SIAM J. Discret. Math., March, 2024

Large cliques or cocliques in hypergraphs with forbidden order-size pairs.
Comb. Probab. Comput., 2024

A class of graphs of zero Turán density in a hypercube.
Comb. Probab. Comput., 2024

2023
Interval colorings of graphs - Coordinated and unstable no-wait schedules.
J. Graph Theory, December, 2023

Extremal numbers for cycles in a hypercube.
Discret. Appl. Math., December, 2023

Sum-distinguishing number of sparse hypergraphs.
Eur. J. Comb., August, 2023

Generalized Turán densities in the hypercube.
Discret. Math., 2023

2022
High girth hypergraphs with unavoidable monochromatic or rainbow edges.
Discuss. Math. Graph Theory, 2022

The Erdős-Hajnal conjecture for three colors and triangles.
Discret. Math., 2022

Splits with forbidden subgraphs.
Discret. Math., 2022

Strong complete minors in digraphs.
Comb. Probab. Comput., 2022

2021
Bipartite Independence Number in Graphs with Bounded Maximum Degree.
SIAM J. Discret. Math., 2021

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs.
J. Graph Theory, 2021

Long path and cycle decompositions of even hypercubes.
Eur. J. Comb., 2021

Induced Ramsey Number for a Star Versus a Fixed Graph.
Electron. J. Comb., 2021

2020
On induced Ramsey numbers for multiple copies of graphs.
J. Graph Theory, 2020

2019
Polychromatic Colorings on the Integers.
Integers, 2019

A Note on Saturation for Berge-G Hypergraphs.
Graphs Comb., 2019

A note on Ramsey numbers for Berge-G hypergraphs.
Discret. Math., 2019

Induced and weak induced arboricities.
Discret. Math., 2019

Induced saturation of graphs.
Discret. Math., 2019

Planar Ramsey Graphs.
Electron. J. Comb., 2019

Clumsy Packings of Graphs.
Electron. J. Comb., 2019

2018
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
J. Graph Theory, 2018

The k-strong induced arboricity of a graph.
Eur. J. Comb., 2018

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs.
Comb., 2018

2017
Boolean Lattices: Ramsey Properties and Embeddings.
Order, 2017

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths.
J. Graph Theory, 2017

Conditions on Ramsey Nonequivalence.
J. Graph Theory, 2017

The chromatic number of ordered graphs with constrained conflict graphs.
Australas. J Comb., 2017

2016
Density of range capturing hypergraphs.
J. Comput. Geom., 2016

Spectrum of Mixed Bi-uniform Hypergraphs.
Graphs Comb., 2016

A note on adjacent vertex distinguishing colorings of graphs.
Discret. Appl. Math., 2016

2015
Brooks type results for conflict-free colorings and {a, b}-factors in graphs.
Discret. Math., 2015

2014
On the Chromatic Number of Subsets of the Euclidean Plane.
Graphs Comb., 2014

Twins in graphs.
Eur. J. Comb., 2014

Multicolor Ramsey numbers for triple systems.
Discret. Math., 2014

Packing polyominoes clumsily.
Comput. Geom., 2014

2013
Visibility Number of Directed Graphs.
SIAM J. Discret. Math., 2013

A regularity lemma and twins in words.
J. Comb. Theory, Ser. A, 2013

Unavoidable subtrees.
Discret. Math., 2013

Fork-forests in bi-colored complete bipartite graphs.
Discret. Appl. Math., 2013

2012
Q 2-free Families in the Boolean Lattice.
Order, 2012

2011
On homometric sets in graphs.
Electron. Notes Discret. Math., 2011

List precoloring extension in planar graphs.
Discret. Math., 2011

A note on the monotonicity of mixed Ramsey numbers.
Discret. Math., 2011

2010
On the structure of minimal winning coalitions in simple voting games.
Soc. Choice Welf., 2010

On Colorings Avoiding a Rainbow Cycle and a Fixed Monochromatic Subgraph.
Electron. J. Comb., 2010

2009
When do Three Longest Paths have a Common Vertex?
Discret. Math. Algorithms Appl., 2009

Avoiding rainbow induced subgraphs in edge-colorings.
Australas. J Comb., 2009

2008
On the editing distance of graphs.
J. Graph Theory, 2008

Edge-colorings avoiding rainbow and monochromatic subgraphs.
Discret. Math., 2008

Avoiding Rainbow Induced Subgraphs in Vertex-Colorings.
Electron. J. Comb., 2008

2007
Graphs Having Small Number of Sizes on Induced k-Subgraphs.
SIAM J. Discret. Math., 2007

Rainbows in the Hypercube.
Graphs Comb., 2007

On weighted Ramsey numbers.
Australas. J Comb., 2007

2006
On the Strong Chromatic Number of Graphs.
SIAM J. Discret. Math., 2006

Avoiding Patterns in Matrices Via a Small Number of Changes.
SIAM J. Discret. Math., 2006

Sub-Ramsey Numbers for Arithmetic Progressions.
Graphs Comb., 2006

A note on short cycles in a hypercube.
Discret. Math., 2006

On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs.
Electron. J. Comb., 2006

2005
Canonical Pattern Ramsey Numbers.
Graphs Comb., 2005

2004
Bipartite anti-Ramsey numbers of cycles.
J. Graph Theory, 2004

On Rainbow Arithmetic Progressions.
Electron. J. Comb., 2004

Anti-Ramsey numbers for small complete bipartite graphs.
Ars Comb., 2004

2003
On multiple coverings of the infinite rectangular grid with balls of constant radius.
Discret. Math., 2003

Exact Bounds on the Sizes of Covering Codes.
Des. Codes Cryptogr., 2003

Local Anti-Ramsey Numbers of Graphs.
Comb. Probab. Comput., 2003

A Note on Graph Coloring Extensions and List-Colorings.
Electron. J. Comb., 2003

2001
Embedding of graphs in two-irregular graphs.
J. Graph Theory, 2001

On a Generalized Anti-Ramsey Problem.
Comb., 2001

2000
On Generalized Ramsey Theory: The Bipartite Case.
J. Comb. Theory, Ser. B, 2000

A generalized Ramsey problem.
Discret. Math., 2000

1995
On set systems without weak 3-Delta-subsystems.
Discret. Math., 1995


  Loading...