A $ k $-uniform hypergraph $ H=(V, E) $ is $ k $-partite if $ V $ can be partitioned into $ k $
sets $ V_1,\ldots, V_k $ such that every edge in $ E $ contains precisely one vertex from …

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 with a fixed bipartition is an independent set …

Symmetries found through automorphisms or graph fibrations provide important insights in
network analysis. Symmetries identify clusters of robust synchronization in the network …

In this paper, we establish a couple of results on extremal problems in bipartite graphs.
Firstly, we show that every sufficiently large bipartite graph with average degree D and with …

One of the central goals in extremal combinatorics is to understand how the global structure
of a combinatorial object, eg a graph, hypergraph or set system, is affected by local …

Many optimization problems can be phrased in terms of constraint satisfaction. In particular
MAX-2-SAT and MAX-2-CSP are known to generalize many hard combinatorial problems on …

A bi-hole of size t in a bipartite graph G is a copy of K t, t in the bipartite complement of G.
Given an n× n bipartite graph G, let β (G) be the largest k for which G has a bi-hole of size k …

We consider in this article the Two-Machine Cross-Docking Flow Shop Problem, which is a
special case of scheduling with typed tasks, where we have two types of tasks and one …

In this paper, we establish a couple of results on extremal problems in bipartite graphs.
Firstly, we show that every sufficiently large bipartite graph with average degree∆ and with n …

Traditional studies of multi-source, multi-terminal interference channels typically allow a
vanishing probability of error in communication. Motivated by the study of network coding …