wovepaper — the arXiv observatory

papers

Publications (74)

math.CO2014

Spectrum of mixed bi-uniform hypergraphs

Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt

A mixed hypergraph is a triple $H = (V, C, D)$ , where $V$ is a set of vertices, $C$ and $D$ are sets of hyperedges. A vertex-coloring of $H$ is…

math.CO2011

List precoloring extension in planar graphs

Maria Axenovich, Joan P. Hutchinson, Michelle A. Lastrina

A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned…

math.CO2025

Online Ramsey turnaround numbers

NÃ³ra AlmÃ¡si, Maria Axenovich

The online Ramsey turnaround game is a game between two players, Builder and Painter, on a board of $n$ vertices using $3$ colors, for a fixed graph $H$ on at most $n$ vertices. Th…

math.CO2026

A note on Ramsey numbers for minors

Maria Axenovich, Raphael Steiner

Let $R_{h} (k; ℓ)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $ℓ$ colors results in a monochromatic $K_{k}$ -minor, in other wor…

math.CO2023

A note on multicolour ErdÅs-Hajnal conjecture

Maria Axenovich, Lea Weber

Informally, the ErdÅs-Hajnal conjecture (shortly EH-conjecture) asserts that if a sufficiently large host clique on $n$ vertices is edge-coloured avoiding a copy of some fixed edg…

math.CO2018

Planar Ramsey graphs

Maria Axenovich, Carsten Thomassen, Ursula Schade +1

We say that a graph $H$ is planar unavoidable if there is a planar graph $G$ such that any red/blue coloring of the edges of $G$ contains a monochromatic copy of $H$ , otherwise we…

math.CO2022

Unavoidable order-size pairs in hypergraphs -- positive forcing density

Maria Axenovich, JÃ³zsef Balogh, Felix Christian Clemen +1

ErdÅs, FÃ¼redi, Rothschild and SÃ³s initiated a study of classes of graphs that forbid every induced subgraph on a given number $m$ of vertices and number $f$ of edges. Extending…

math.CO2018

A note on Ramsey numbers for Berge-G hyper graphs

Maria Axenovich, Andras Gyarfas

For a graph G=(V,E), a hypergraph H is called Berge-G if there is a bijection f from E(G) to E(H) such that for each e in E(G), e is a subset of f(e). The set of all Berge-G hyperg…

math.CO2016

A version of SzemerÃ©di's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs

Maria Axenovich, Ryan R. Martin

In this manuscript we develop a version of SzemerÃ©di's regularity lemma that is suitable for analyzing multicolorings of complete graphs and directed graphs. In this, we follow th…

math.CO2023

A note on interval colourings of graphs

Maria Axenovich, AntÃ³nio GirÃ£o, Lawrence Hollom +5

A graph is said to be interval colourable if it admits a proper edge-colouring using palette $N$ in which the set of colours incident to each vertex is an interval. The in…

math.CO2010

A note on monotonicity of mixed Ramsey numbers

Maria Axenovich, JiHyeok Choi

For two graphs, $G$ , and $H$ , an edge-coloring of a complete graph is $(G, H)$ -good if there is no monochromatic subgraph isomorphic to $G$ and no rainbow subgraph isomorphic to $H$ …

math.CO2012

On homometric sets in graphs

Maria Axenovich, Lale Ãzkahya

For a vertex set $S \subseteq V (G)$ in a graph $G$ , the {\em distance multiset}, $D (S)$ , is the multiset of pairwise distances between vertices of $S$ in $G$ . Two vertex sets are ca…

math.CO2020

Induced Ramsey number for a star versus a fixed graph

Maria Axenovich, Izolda Gorgol

For graphs G and H, let the induced Ramsey number IR(H,G) be the smallest number of vertices in a graph F such that any coloring of the edges of F in red and blue, there is either…

math.CO2018

Induced Saturation of Graphs

Maria Axenovich, MÃ³nika CsikÃ³s

A graph $G$ is $H$ -saturated for a graph $H$ , if $G$ does not contain a copy of $H$ but adding any new edge to $G$ results in such a copy. An $H$ -saturated graph on a given number…

math.CO2016

$Q_{2}$ -free families in the Boolean lattice

Maria Axenovich, Jacob Manske, Ryan R. Martin

For a family $F$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $F$ is P-free if it does not contain a subpo…

math.CO2024

Diagonal poset Ramsey numbers

Maria Axenovich, Christian Winter

A poset $(Q, \leq_{Q})$ contains an induced copy of a poset $(P, \leq_{P})$ if there exists an injective mapping $I ¨ : P \to Q$ such that for any two elements $X, Y \in P$ , $X \leq_{P} Y$ if…

math.CO2016

A note on short cycles in a hypercube

Maria Axenovich, Ryan R. Martin

How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul ErdÅs about $27$ years ago. His conjecture that such a subgraph asymptotical…

math.CO2024

On graphs embeddable in a layer of a hypercube and their extremal numbers

Maria Axenovich, Ryan R. Martin, Christian Winter

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_{n}$ , $e x (Q_{n}, H)$ is the largest number of edges in an $H$ -free subgraph of $Q_{n}$ .…

math.CO2023

A class of graphs of zero TurÃ¡n density in a hypercube

Maria Axenovich

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_{n}$ , $e x (Q_{n}, H)$ is the largest number of edges in an $H$ -free subgraph of $Q_{n}$ .…

math.CO2015

Conditions on Ramsey non-equivalence

Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt

Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramse…

math.CO2018

On induced Ramsey numbers for multiple copies of graphs

Maria Axenovich, Izolda Gorgol

We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F…

math.CO2022

Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by ErdÅs and Tuza

Maria Axenovich, Felix Christian Clemen

An edge-coloring of a complete graph with a set of colors $C$ is called completely balanced if any vertex is incident to the same number of edges of each color from $C$ . ErdÅs and…

math.CO2016

The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs

Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt

An ordered graph $G$ is a graph whose vertex set is a subset of integers. The edges are interpreted as tuples $(u, v)$ with $u < v$ . For a positive integer $s$ , a matrix $M \in \mat…

math.CO2024

On hypercube statistics

Noga Alon, Maria Axenovich, John Goldwasser

Let $d \geq 1$ and $s \leq 2^{d}$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_{n}$ and $n \geq d$ , let $I^» (n, d, s, A)$ denote the fraction of subcubes $Q_{d}$ …

math.CO2016

Avoiding patterns in matrices via a small number of changes

Maria Axenovich, Ryan R. Martin

Let $A = {A_{1}, \dots, A_{r}}$ be a partition of a set ${1, \dots, m} \times {1, \dots, n}$ into $r$ nonempty subsets, and $A = (a_{ij})$ be an $m \times n$ matrix. We say that $…

math.CO2017

The $k$ -strong induced arboricity of a graph

Maria Axenovich, Daniel Goncalves, Jonathan Rollin +1

The induced arboricity of a graph $G$ is the smallest number of induced forests covering the edges of $G$ . This is a well-defined parameter bounded from above by the number of edge…

math.CO2013

Online and size anti-Ramsey numbers

Maria Axenovich, Kolja Knauer, Judith Stumpp +1

A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multico…

math.CO2015

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

Maria Axenovich, Torsten Ueckerdt, Pascal Weiner

Recently, Borodin, Kostochka, and Yancey (On $1$ -improper $2$ -coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth…

math.CO2021

Absolutely avoidable order-size pairs for induced subgraphs

Maria Axenovich, Lea Weber

We call a pair $(m, f)$ of integers, $m \geq 1$ , $0 \leq f \leq (2 m)$ , \emph{absolutely avoidable} if there is $n_{0}$ such that for any pair of integers $(n, e)$ with $n > n_{0}$ an…

math.CO2021

The ErdÅs-Hajnal conjecture for three colors and multiple forbidden patterns

Maria Axenovich, Richard Snyder, Lea Weber

ErdÅs and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at l…

math.CO2016

On the editing distance of graphs

Maria Axenovich, AndrÃ© KÃ©zdy, Ryan R. Martin

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 $G$ , the editing…

math.CO2022

Interval colorings of graphs -- coordinated and unstable no-wait schedules

Maria Axenovich, Michael Zheng

A proper edge-coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval of consecutive integers. Interval thickness s(G) of a g…

math.CO2016

On the strong chromatic number of graphs

Maria Axenovich, Ryan R. Martin

The strong chromatic number, $I ¨ _{S} (G)$ , of an $n$ -vertex graph $G$ is the smallest number $k$ such that after adding $k ⌈ n / k ⌉ - n$ isolated vertices to $G$ and considering…

math.CO2021

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

Maria Axenovich, Christian Winter

Given partially ordered sets (posets) $(P, \leq_{P})$ and $(P^{'}, \leq_{P^{'}})$ , we say that $P^{'}$ contains a copy of $P$ if for some injective function $f : P \to P^{'}$ and for any $…

math.CO2026

Visibility in hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $M$ ``see'' each other in $G$ , that is, there exists a shortest $u, v$ -path in…

math.CO2023

Large cliques or co-cliques in hypergraphs with forbidden order-size pairs

Maria Axenovich, Domagoj BradaÄ, Lior Gishboliner +2

The well-known ErdÅs-Hajnal conjecture states that for any graph $F$ , there exists $I^µ > 0$ such that every $n$ -vertex graph $G$ that contains no induced copy of $F$ has a homogeneo…

math.CO2020

Bipartite independence number in graphs with bounded maximum degree

Maria Axenovich, Jean-SÃ©bastien Sereni, Richard Snyder +1

We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite…

math.CO2023

Poset Ramsey number $R (P, Q_{n})$ . II. N-shaped poset

Maria Axenovich, Christian Winter

Given partially ordered sets (posets) $(P, \leq_{P})$ and $(P^{'}, \leq_{P^{'}})$ , we say that $P^{'}$ contains a copy of $P$ if for some injective function $f : P \to P^{'}$ and for…

math.CO2015

Density of Range Capturing Hypergraphs

Maria Axenovich, Torsten Ueckerdt

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 subset $Y$ of $X$ is captured by $S$ if there is a homoth…

math.CO2026

A note on the mutual-visibility coloring of hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if for any two vertices $u, v \in M$ there exists a shortest $u$ - $v$ path in $G$ that contains no elements of $M$ …

math.CO2021

Sum-distinguishing number of sparse hypergraphs

Maria Axenovich, Yair Caro, Raphael Yuster

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. Let s(H) be the smalles…

math.CO2026

Vertex-Ramsey theorems for Cartesian powers of graphs

Nóra Almási, Maria Axenovich, Arsenii Sagdeev

For graphs $G, H$ and positive integers $r$ and $n$ we write $G^{□ n} r H$ if every $r$ -vertex-coloring of the Cartesian power $G^{□ n}$ of $G$ contains a…

math.CO2025

Splits with forbidden subgraphs

Maria Axenovich, Ryan R. Martin

In this note, we fix a graph $H$ and ask into how many vertices can each vertex of a clique of size $n$ can be "split" such that the resulting graph is $H$ -free. Formally: A graph…

math.CO2025

Turán problems for simplicial complexes

Maria Axenovich, DÃ¡niel Gerbner, Dániel Gerbner +3

An abstract simplicial complex $F$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n…

math.CO2012

A regularity lemma and twins in words

Maria Axenovich, Yury Person, Svetlana Puzynina

For a word $S$ , let $f (S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$ . Let $f(n, Î£) = \min \{f(S): S \text{is of len…

math.CO2021

Long path and cycle decompositions of even hypercubes

Maria Axenovich, David Offner, Casey Tompkins

We consider edge decompositions of the $n$ -dimensional hypercube $Q_{n}$ into isomorphic copies of a given graph $H$ . While a number of results are known about decomposing $Q_{n}$ into…

math.CO2018

A note on saturation for Berge-G hypergraphs

Maria Axenovich, Christian Winter

For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, whe…

cs.DM2012

Fork-forests in bi-colored complete bipartite graphs

Maria Axenovich, Marcus Krug, Georg Osang +1

Motivated by the problem in [6], which studies the relative efficiency of propositional proof systems, 2-edge colorings of complete bipartite graphs are investigated. It is shown t…

math.CO2016

High girth hypergraphs with unavoidable monochromatic or rainbow edges

Maria Axenovich, Annette Karrer

A classical result of ErdÅs and Hajnal claims that for any integers $k, r, g \geq 2$ there is an $r$ -uniform hypergraph of girth at least $g$ with chromatic number at least $k$ . T…

math.CO2025

An improved upper bound for the multicolour Ramsey number of odd cycles

Maria Axenovich, Wouter Cames van Batenburg, Oliver Janzer +2

We show that the $k$ -colour Ramsey number of an odd cycle of length $2 ℓ + 1$ is at most $(4 ℓ)^{k} \cdot k^{k / ℓ}$ . This proves a conjecture of Fox and is the first improvem…

math.CO2018

Polychromatic Colorings on the Integers

Maria Axenovich, John Goldwasser, Bernard LidickÃ½ +4

We show that for any set $S \subseteq Z$ , $∣ S ∣ = 4$ there exists a 3-coloring of $Z$ in which every translate of $S$ receives all three colors. This implies that $S$ …

math.CO2023

Homogeneous sets in hypergraphs with forbidden order-size pairs

Maria Axenovich, Dhruv Mubayi, Lea Weber

The well-known ErdÅs-Hajnal conjecture states that for any graph $F$ , there exists $I^µ > 0$ such that every $n$ -vertex graph $G$ that contains no induced copy of $F$ has a homogeneo…

math.CO2022

Extremal numbers for cycles in a hypercube

Maria Axenovich

Let $e x (Q_{n}, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_{n}$ such that there is no subgraph of $G$ isomorphic to $H$ . We show that for any integer $k\geq…

math.CO2016

Chromatic number of ordered graphs with forbidden ordered subgraphs

Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt

It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., grap…

math.CO2019

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs

Maria Axenovich, Casey Tompkins, Lea Weber

For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K_{t,t}. For a class F of graphs, let h(F)= min {h(G): G\in F}. We sa…

math.CO2016

Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs

Maria Axenovich, Jonathan Rollin

A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let $f (r, I^)$ be the smallest inte…

math.CO2025

Faces in girth-saturated graphs on surfaces

Maria Axenovich, Leon KieÃle, Arsenii Sagdeev +1

What is the maximum length $f_{max} (ℓ, I^£)$ of a facial cycle of an inclusion-maximal graph with girth at least $ℓ$ embedded on a given surface $I^£$ ? If $Î£=\mathca…

math.CO2021

Canonical theorems for colored integers with respect to some linear combinations

Maria Axenovich, David S. Gunderson, Hanno Lefmann

Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that…

math.CO2026

Chromatic Ramsey numbers and two-color TurÃ¡n densities

Maria Axenovich, Simon Gaa, Dingyuan Liu

Given a graph $G$ , its $2$ -color TurÃ¡n number $ex^{(2)} (n, G)$ is the maximum number of edges in an $n$ -vertex graph, such that the edges can be colored with two colors av…

math.CO2016

Multicolor and directed edit distance

Maria Axenovich, Ryan R. Martin

The editing of a combinatorial object is the alteration of some of its elements such that the resulting object satisfies a certain fixed property. The edit problem for graphs, when…

math.CO2024

Induced TurÃ¡n problem in bipartite graphs

Maria Axenovich, Jakob Zimmermann

The classical extremal function for a graph $H$ , $e x (K_{n}, H)$ is the largest number of edges in a subgraph of $K_{n}$ that contains no subgraph isomorphic to $H$ . Note that defining…

math.CO2016

On weighted Ramsey numbers

Maria Axenovich, Ryan Martin

The weighted Ramsey number, $wR (n, k)$ , is the minimum $q$ such that there is an assignment of nonnegative real numbers (weights) to the edges of $K_{n}$ with the total sum of t…

math.CO2015

Boolean lattices: Ramsey properties and embeddings

Maria Axenovich, Stefan Walzer

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 \leq y$ in $P$ iff $f (x) \leq f (y)$ in $Q^{'}$ . For pos…

math.CO2018

Induced and Weak Induced Arboricities

Maria Axenovich, Philip DÃ¶rr, Jonathan Rollin +1

We define the induced arboricity of a graph $G$ , denoted by $ia (G)$ , as the smallest $k$ such that the edges of $G$ can be covered with $k$ induced forests in $G$ . This notio…

math.CO2022

Generalized TurÃ¡n densities in the hypercube

Maria Axenovich, Laurin Benz, David Offner +1

A classical extremal, or TurÃ¡n-type problem asks to determine $ex (G, H)$ , the largest number of edges in a subgraph of a graph $G$ which does not contain a subgraph isomorph…

math.CO2025

Ramsey problems for graphs in Euclidean spaces and Cartesian powers

Maria Axenovich, Dingyuan Liu, Arsenii Sagdeev

Given a graph $H$ , let $I ¨ _{H} (R^{n})$ be the smallest positive integer $r$ such that there exists an $r$ -coloring of $R^{n}$ with no monochromatic unit-copy of $H$ , th…

math.CO2013

Twins in graphs

Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt

A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a…

math.CO2013

Multicolor Ramsey numbers for triple systems

Maria Axenovich, Andras Gyarfas, Hong Liu +1

Given an $r$ -uniform hypergraph $H$ , the multicolor Ramsey number $r_{k} (H)$ is the minimum $n$ such that every $k$ -coloring of the edges of the complete $r$ -uniform hypergraph $K_n^…

math.CO2016

Sub-Ramsey numbers for arithmetic progressions

Maria Axenovich, Ryan R. Martin

Let the integers $1, \dots, n$ be assigned colors. SzemerÃ©di's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that…

math.CO2020

Strong complete minors in digraphs

Maria Axenovich, AntÃ³nio GirÃ£o, Richard Snyder +1

Kostochka and Thomason independently showed that any graph with average degree $I^c ◯ (r lo g r)$ contains a $K_{r}$ minor. In particular, any graph with chromatic number $Î©(r\sqr…

math.CO2018

Clumsy packings of graphs

Maria Axenovich, Anika Kaufmann, Raphael Yuster

Let $G$ and $H$ be graphs. We say that $P$ is an $H$ -packing of $G$ if $P$ is a set of edge-disjoint copies of $H$ in $G$ . An $H$ -packing $P$ is maximal if there is no other $H$ -pa…

math.CO2016

Avoiding rainbow induced subgraphs in vertex-colorings

Maria Axenovich, Ryan Martin

For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G \to H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced sub…

math.CO2026

Largest density of a layered subgraph of a hypercube

Maria Axenovich, Arsenii Sagdeev

Let $L (t)$ denote the largest number of edges induced by $t$ vertices from two vertex layers of a hypercube. We show that $$\frac14 t\log_2 t+\frac18 t\log_2\log_2 t-O(t) \leq L(t)…

math.CO2016

Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

Maria Axenovich, John Goldwasser, Ryan Hansen +5

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…

Publications (74)

Spectrum of mixed bi-uniform hypergraphs

List precoloring extension in planar graphs

Online Ramsey turnaround numbers

A note on Ramsey numbers for minors

A note on multicolour ErdÅs-Hajnal conjecture

Planar Ramsey graphs

Unavoidable order-size pairs in hypergraphs -- positive forcing density

A note on Ramsey numbers for Berge-G hyper graphs

A version of SzemerÃ©di's regularity lemma for multicolored graphs and directed graphs that is suitable for induced graphs

A note on interval colourings of graphs

A note on monotonicity of mixed Ramsey numbers

On homometric sets in graphs

Induced Ramsey number for a star versus a fixed graph

Induced Saturation of Graphs

Q2​-free families in the Boolean lattice

Diagonal poset Ramsey numbers

A note on short cycles in a hypercube

On graphs embeddable in a layer of a hypercube and their extremal numbers

A class of graphs of zero TurÃ¡n density in a hypercube

Conditions on Ramsey non-equivalence

On induced Ramsey numbers for multiple copies of graphs

Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by ErdÅs and Tuza

The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs

On hypercube statistics

Avoiding patterns in matrices via a small number of changes

The k-strong induced arboricity of a graph

Online and size anti-Ramsey numbers

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

Absolutely avoidable order-size pairs for induced subgraphs

The ErdÅs-Hajnal conjecture for three colors and multiple forbidden patterns

On the editing distance of graphs

Interval colorings of graphs -- coordinated and unstable no-wait schedules

On the strong chromatic number of graphs

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

Visibility in hypercubes

Large cliques or co-cliques in hypergraphs with forbidden order-size pairs

Bipartite independence number in graphs with bounded maximum degree

Poset Ramsey number R(P,Qn​). II. N-shaped poset

Density of Range Capturing Hypergraphs

A note on the mutual-visibility coloring of hypercubes

Sum-distinguishing number of sparse hypergraphs

Vertex-Ramsey theorems for Cartesian powers of graphs

Splits with forbidden subgraphs

Turán problems for simplicial complexes

A regularity lemma and twins in words

Long path and cycle decompositions of even hypercubes

A note on saturation for Berge-G hypergraphs

Fork-forests in bi-colored complete bipartite graphs

High girth hypergraphs with unavoidable monochromatic or rainbow edges

An improved upper bound for the multicolour Ramsey number of odd cycles

Polychromatic Colorings on the Integers

Homogeneous sets in hypergraphs with forbidden order-size pairs

Extremal numbers for cycles in a hypercube

Chromatic number of ordered graphs with forbidden ordered subgraphs

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs

Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs

Faces in girth-saturated graphs on surfaces

Canonical theorems for colored integers with respect to some linear combinations

Chromatic Ramsey numbers and two-color TurÃ¡n densities

Multicolor and directed edit distance

Induced TurÃ¡n problem in bipartite graphs

On weighted Ramsey numbers

Boolean lattices: Ramsey properties and embeddings

Induced and Weak Induced Arboricities

Generalized TurÃ¡n densities in the hypercube

Ramsey problems for graphs in Euclidean spaces and Cartesian powers

Twins in graphs

Multicolor Ramsey numbers for triple systems

Sub-Ramsey numbers for arithmetic progressions

Strong complete minors in digraphs

Clumsy packings of graphs

Avoiding rainbow induced subgraphs in vertex-colorings

Largest density of a layered subgraph of a hypercube

Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

A note on multicolour ErdÅs-Hajnal conjecture

$Q_{2}$ -free families in the Boolean lattice

Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by ErdÅs and Tuza

The $k$ -strong induced arboricity of a graph

The ErdÅs-Hajnal conjecture for three colors and multiple forbidden patterns

Poset Ramsey number $R (P, Q_{n})$ . II. N-shaped poset