A pair (A,B) of hypergraphs is called orthogonal if |a ∩ b|=1 for
every ...
We give a simple proof of a recent result of Gollin and Joó: if a possib...
A generalization of the famous Caccetta–Häggkvist conjecture, suggested ...
Extracting expressive visual features is crucial for accurate
Click-Thro...
Given a graph G and a coloring of its edges, a subgraph of G is called
r...
In this paper we solve two problems of Esperet, Kang and Thomasse as wel...
The Prague dimension of graphs was introduced by Nesetril, Pultr and Rod...
A network is a typical expressive form of representing complex systems i...
Extracting entity from images is a crucial part of many OCR applications...
This note contains a refined alteration approach for constructing H-free...
In 1995 Kim famously proved the Ramsey bound R(3,t) > c t^2/ t by
constr...