Results 41 to 50 of about 11,127 (100)
Edge intersection hypergraphs [PDF]
If \( \mathcal{H}=(V, \mathcal{E} ) \) is a hypergraph, its edge intersection hypergraph \( EI( \mathcal{H} )=(V, \mathcal{E}^{EI} ) \) has the edge set \( \mathcal{E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in \mathcal{E} \ \wedge \ e_1 \neq e_2 \ \wedge ...
Teichert, Hanns-Martin, Sonntag, Martin
core +1 more source
Hyper-Null Models and Their Applications
Entropy, 2023 Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce.
Yujie Zeng +3 more
doaj +1 more source
07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs
, 2007 The following is a list of the problems presented on Monday, July 9, 2007 at the open-problem session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, held at Schloss Dagstuhl in Wadern ...
Stege, Ulrike +3 more
core +1 more source
Journal of Physics: Complexity, 2023 Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size.
Tanu Raghav +2 more
doaj +1 more source
Hypergraph Representation via Axis-Aligned Point-Subspace Cover [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short.
Oksana Firman, Joachim Spoerhase
doaj +1 more source
Simple Containers for Simple Hypergraphs [PDF]
, 2016 We give an easy method for constructing containers for simple hypergraphs. The method also has consequences for non-simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of H-free ...
David Saxton, Andrew Thomason
core +2 more sources
Counting results for sparse pseudorandom hypergraphs II
, 2017 We present a variant of a universality result of Rödl (1986) for sparse, 3-uniform hypergraphs contained in strongly jumbled hypergraphs. One of the ingredients of our proof is a counting lemma for fixed hypergraphs in sparse “pseudorandom” hypergraphs ...
Schacht, Mathias +3 more
core +1 more source
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
网络与信息安全学报In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj +3 more sources
The Uniformity Space of Hypergraphs
, 2012 For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is some k ? F such that the sum of the weights on each edge of H is equal to k.
Mol, Lucas
core
Regular Partitions of Hypergraphs: Counting Lemmas [PDF]
, 2007 This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.We continue the study of regular partitions of hypergraphs.
Schacht, Mathias, Rödel, Vojtech
core +1 more source