Results 121 to 130 of about 11,124 (213)

Nonintersecting ryser hypergraphs

, 2020
A famous conjecture of Ryser states that every r-partite hypergraph has vertex cover number at most r 1 times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as r-Ryser hypergraphs, have been studied extensively ...
Bishnoi A., Pepe V.
core   +1 more source

HyperGodot: Interactive hypergraph visualization tool

SoftwareX
Hypergraphs provide a robust framework for modeling complex, multi-actor interactions that traditional graphs struggle to represent. In many real-world applications, interactions involve more than just pairs of entities, which makes hypergraphs an ...
Attila Ficsor, Timea Czvetko, Viktor Sebestyen, Janos Abonyi   +3 more
doaj   +1 more source

Hypergraphs Accumulate

International Mathematics Research Notices
Abstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire   +2 more sources

Application of hypergraphs in decomposition of discrete systems [PDF]

, 2012
seria: Lecture Notes in Control and Computer Science ; vol ...
Wiśniewska, Monika
core  

K shortest paths in stochastic time-dependent networks [PDF]

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan, Nielsen, Lars Relund, Pretolani, Daniele   +2 more
core  

Entropy-based models to randomise real-world hypergraphs

Communications Physics
Network theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems.
Fabio Saracco, Giovanni Petri, Renaud Lambiotte, Tiziano Squartini   +3 more
doaj   +1 more source

On Turan hypergraphs

Discrete Mathematics, 1978
Let α(H) be the stability number of a hypergraph H = (X, E). T(n, k, α) is the smallest q such that there exists a k-uniform hypergraph H with n vertices, q edges and with α(H) ⩽ α. A k-uniform hypergraph H, with n vertices, T(n, k, α) edges and α(H) ⩽α is a Turan hypergraph. The value of T(n, 2, α) is given by a theorem of Turan.
openaire   +2 more sources

Extending Graph-Based LP Techniques for Enhanced Insights Into Complex Hypergraph Networks

IEEE Access
Many real-world problems can be modelled in the form of complex networks. Social networks such as research collaboration networks and facebook, biological neural networks such as human brains, biomedical networks such as drug-target interactions and ...
Y. V. Nandini, T. Jaya Lakshmi, Murali Krishna Enduri, Hemlata Sharma, Mohd Wazih Ahmad   +4 more
doaj   +1 more source

Colourings of hypergraphs [PDF]

, 1976
In Chapter 2, we describe some generalized chromatic numbers of graphs. In Chapter 3, we describe how these may be regarded as chromatic numbers of associated hypergraphs.
Jones, Rhys Price
core  

Oriented hypergraphs

, 2010
The column dependencies of {0,±1}-matrices which contain at most two non-zero entries in each column have been characterized using orientations of graphs and signed graphs. We introduce a hypergraphic model of {0,±1}-matrices, called oriented hypergraphs,
Rusnak, Lucas J.
core