Results 91 to 100 of about 1,354,678 (274)
Optimizing Staircase Motifs in Biofabric Network Layouts
Computer Graphics Forum, EarlyView.Abstract Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs — equivalent to fans or stars in node‐link diagrams — within Biofabric.
Sara Di Bartolomeo +2 more
wiley +1 more source
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
, 2017 For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$.
Reiher, Christian +2 more
core +1 more source
Three hypergraph eigenvector centralities [PDF]
SIAM Journal on Mathematics of Data Science, 2018 Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph.
Austin R. Benson
semanticscholar +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, EarlyView.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 300-309, August 2025.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +1 more source
The Turán problem for hypergraphs of fixed size [PDF]
, 2005 We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) =3 and f->[infinity]
Keevash, Peter
core
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs
, 2014 We develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
A. Ambainis +8 more
core +1 more source
On Upper Transversals in 3-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2018 A set $S$ of vertices in a hypergraph $H$ is a transversal if it has a nonempty intersection with every edge of $H$. The upper transversal number $\Upsilon(H)$ of $H$ is the maximum cardinality of a minimal transversal in $H$. We show that if $H$ is a connected $3$-uniform hypergraph of order $n$, then $\Upsilon(H) > 1.4855 \sqrt[3]{n} - 2$. For $n$
Henning, Michael A., Yeo, Anders
openaire +4 more sources
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
, 2016 Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs ...
Dukkipati, Ambedkar +1 more
core +1 more source