Search Results - "Axenovich, Maria"

High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges by Axenovich, Maria, Karrer, Annette

“…A classical result of Erdős and Hajnal claims that for any integers ≥ 2 there is an -uniform hypergraph of girth at least with chromatic number at least . This…”
Get full text

Subsets of vertices of the same size and the same maximum distance by Axenovich, Maria, Duerrschnabel, Dominik

“…For a simple connected graph $G=(V,E)$ and a subset $X$ of its vertices, let $$d^*(X) = \max\{{\rm dist}_G(x,y): x,y\in X\}$$ and let $h^*(G)$ be the largest…”
Get full text

Density of range capturing hypergraphs by Maria Axenovich, Torsten Ueckerdt

“…$\newcommand{\cH}{\mathcal{H}}$For a finite set $X$ of points in the plane, a set $S$ in the plane, and a positive integer $k$, we say that a $k$-element…”
Get full text

Extremal numbers for cycles in a hypercube by Axenovich, Maria

“…Let ex(Qn,H) be the largest number of edges in a subgraph G of a hypercube Qn such that there is no subgraph of G isomorphic to H. We show that for any integer…”
Get full text

Edge-colorings avoiding rainbow and monochromatic subgraphs by Axenovich, Maria, Iverson, Perry

“…For two graphs G and H, let the mixed anti-Ramsey numbers, max R ( n ; G , H ) , ( min R ( n ; G , H ) ) be the maximum (minimum) number of colors used in an…”
Get full text

Induced Turán problem in bipartite graphs by Axenovich, Maria, Zimmermann, Jakob

“…The classical extremal function for a graph H, ex(Kn,H) is the largest number of edges in a subgraph of Kn that contains no subgraph isomorphic to H. Note that…”
Get full text

On the editing distance of graphs by Axenovich, Maria, Kézdy, André, Martin, Ryan

“…An edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal…”
Get full text

Classical and Quantum Magnetism in Giant Keplerate Magnetic Molecules by Müller, Achim, Luban, Marshall, Schröder, Christian, Modler, Robert, Kögerler, Paul, Axenovich, Maria, Schnack, Jürgen, Canfield, Paul, Bud'ko, Sergey, Harrison, Neil

“…Complementary theoretical modeling methods are presented for the classical and quantum Heisenberg model to explain the magnetic properties of nanometer‐sized…”
Get full text

Interval colorings of graphs—Coordinated and unstable no‐wait schedules by Axenovich, Maria, Zheng, Michael

“…A proper edge‐coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval, that is, form a set of…”
Get full text

On multiple coverings of the infinite rectangular grid with balls of constant radius by Axenovich, Maria A.

“…We consider the coverings of graphs with balls of constant radius satisfying special multiplicity condition. A ( t, i, j)-cover of a graph G=( V, E) is a…”
Get full text

Poset Ramsey Number R(P,Qn). II. N-Shaped Poset by Axenovich, Maria, Winter, Christian

“…Given partially ordered sets (posets) ( P , ≤ P ) and ( P ′ , ≤ P ′ ) , we say that P ′ contains a copy of P if for some injective function f : P → P ′ and for…”
Get full text

Bipartite anti-Ramsey numbers of cycles by Axenovich, Maria, Jiang, Tao, Kündgen, André

“…We determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k contains at least two edges of the same color…”
Get full text

On induced Ramsey numbers for multiple copies of graphs by Axenovich, Maria, Gorgol, Izolda

“…We say that a graph F strongly arrows a pair of graphs (G,H) and write F→ind(G,H) if any coloring of its edges with red and blue leads to either a red G or a…”
Get full text

Induced Ramsey Number for a Star Versus a Fixed Graph by Axenovich, Maria, Gorgol, Izolda

“…We write $F{\buildrel {\text{ind}} \over \longrightarrow}(H,G)$ for graphs $F, G,$ and $H$, if for any coloring of the edges of $F$ in red and blue, there is…”
Get full text

Splits with forbidden subgraphs by Axenovich, Maria, Martin, Ryan R.

“…In this paper, we fix a graph H and ask into how many vertices each vertex of a clique of size n can be “split” such that the resulting graph is H-free…”
Get full text

Boolean Lattices: Ramsey Properties and Embeddings by Axenovich, Maria, Walzer, Stefan

“…A subposet Q ′ of a poset Q is a copy of a poset P if there is a bijection f between elements of P and Q ′ such that x ≤ y in P iff f ( x ) ≤ f ( y ) in Q. For…”
Get full text

A Note on Saturation for Berge-G Hypergraphs by Axenovich, Maria, Winter, Christian

“…For a graph G = ( V , E ) , a hypergraph H is called Berge-G if there is a hypergraph H ′ , isomorphic to H , so that V ( G ) ⊆ V ( H ′ ) and there is a…”
Get full text

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs by Axenovich, Maria, Tompkins, Casey, Weber, Lea

“…For a bipartite graph G, let h ˜ ( G ) be the largest t such that either G contains K t , t, a complete bipartite subgraph with parts of size t, or the…”
Get full text

Sum-distinguishing number of sparse hypergraphs by Axenovich, Maria, Caro, Yair, Yuster, Raphael

“…A vertex labeling of a hypergraph is sum distinguishing if it uses positive integers and the sums of labels taken over the distinct hyperedges are distinct…”
Get full text

The Erdős-Hajnal conjecture for three colors and triangles by Axenovich, Maria, Snyder, Richard, Weber, Lea

“…Erdős and Szekeres's quantitative version of Ramsey's theorem asserts that in every 2-edge-coloring of Kn there is a monochromatic clique on at least 12log⁡n…”
Get full text