Results 51 to 60 of about 622 (164)
Colorful Subhypergraphs in Uniform Hypergraphs
The Electronic Journal of Combinatorics, 2017 There are several topological results ensuring in any properly colored graph the existence of a colorful complete bipartite subgraph, whose order is bounded from below by some topological invariants of some topological spaces associated to the graph. Meunier [Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 2014 ...
openaire +3 more sources
2-Colorability of r-Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2019 A hypergraph is properly 2-colorable if each vertex can be colored by one of two colors and no edge is completely colored by a single color. We present a complete algebraic characterization of the 2-colorability of r-uniform hypergraphs. This generalizes a well known algebraic characterization of k-colorability of graphs due to Alon, Tarsi, Lovasz, de ...
Krul, Michael, Thoma, Luboš
openaire +3 more sources
A Cheeger Cut for Uniform Hypergraphs [PDF]
Graphs and Combinatorics, 2021 AbstractThe graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is bounded both above and below by the generalized Cheeger constant, and the corresponding eigenfunctions can ...
openaire +5 more sources
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
Book free 3-uniform hypergraphs
Discrete MathematicsA $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$.
Debarun Ghosh +5 more
openaire +3 more sources
Monochromatic loose paths in multicolored $k$-uniform cliques [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 For integers $k\ge 2$ and $\ell\ge 0$, a $k$-uniform hypergraph is called a loose path of length $\ell$, and denoted by $P_\ell^{(k)}$, if it consists of $\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and $e_i\cap e_j=\emptyset$
Andrzej Dudek, Andrzej Ruciński
doaj +1 more source
Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles
AKCE International Journal of Graphs and Combinatorics, 2016 We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-magic labeling of hypergraphs. For a hypergraph H with a finite vertex set V and a hyperedge set E, a bijective function f:V∪E→{1,2,3,…,|V|+|E|} is called
Ratinan Boonklurb +2 more
doaj +1 more source
Unsupervised hyperlink prediction based on hypergraph random walk
Complex & Intelligent SystemsConventional link prediction methods mainly aim to estimate pairwise relationships between nodes in graph structures, typically addressing single-type interactions.
Yanlin Yang +5 more
doaj +1 more source
Families of triples with high minimum degree are hamiltonian
Discussiones Mathematicae Graph Theory, 2014 In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj +1 more source
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2015 Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj +1 more source