Results 101 to 110 of about 11,596 (195)
Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
Discussiones Mathematicae Graph Theory, 2016 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng +3 more
doaj +1 more source
Complement Reducible Uniform Hypergraphs
AxiomsWe investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given r-co-hypergraphs and the join operation, which inserts all hyperedges of ...
Frank Gurski, Jochen Rethmann
doaj +1 more source
Transversal numbers of uniform hypergraphs
Graphs and Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +1 more source
Regular subgraphs of uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2016 We prove that for every integer $r\geq 2$, an $n$-vertex $k$-uniform hypergraph $H$ containing no $r$-regular subgraphs has at most $(1+o(1)){{n-1}\choose{k-1}}$ edges if $k\geq r+1$ and $n$ is sufficiently large. Moreover, if $r\in\{3,4\}$, $r\mid k$ and $k,n$ are both sufficiently large, then the maximum number of edges in an $n$-vertex $k$-uniform ...
openaire +4 more sources
Enumeration of unlabeled uniform hypergraphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Finding Set Extreme 3-Uniform Hypergraphs Cardinality through Second-Order Signatures
AxiomsThis paper continues the study of second-order signature properties—the characterization of the extreme 3-uniform hypergraph. Previously, bases were used to count extreme 3-uniform hypergraphs.
Evgeniya Egorova +3 more
doaj +1 more source
Online matching on 3-uniform hypergraphs
Mathematical ProgrammingAbstract The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio is $$1-1/e$$
S.J. Borst (Sander) +2 more
openaire +5 more sources
Recognizing the P 4-structure of claw-free graphs and a larger graph class
Discrete Mathematics & Theoretical Computer Science, 2002 The P 4-structure of a graph G is a hypergraph H on the same vertex set such that four vertices form a hyperedge in H whenever they induce a P 4 in G.
Luitpold Babel +2 more
doaj
Information theory for hypergraph similarity. [PDF]
Sci AdvFelippe H, Kirkley A, Battiston F.
europepmc +1 more source