Digraph realization problem

The Digraph Realization Problem is a key issue in graph theory, specifically within the context of directed graphs (digraphs). The problem can be described as follows: Given a set of vertices and a collection of directed edges (or arcs), the goal is to determine whether there exists a directed graph (digraph) that can represent those edges while satisfying specific combinatorial properties.