Results 161 to 170 of about 538 (183)
Some of the next articles are maybe not open access.
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs.
Australas. J Comb., 2014In this paper we consider the problem of determining all values of v for which there exists a decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies of a given 3-uniform hypergraph. We solve the problem for each 3-uniform hypergraph having at most three edges and at most six vertices, and for the 3-uniform hypergraph
Bryant, Darryn +3 more
openaire +2 more sources
Greedy colorings of uniform hypergraphs
Random Structures & Algorithms, 2009AbstractWe give a very short proof of an Erdős conjecture that the number of edges in a non‐2‐colorable n‐uniform hypergraph is at least f(n)2n, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least clog n. With an ingenious recoloring idea he later proved that f(n) ≥ cn1/3+o(1). Here we prove a weaker
openaire +3 more sources
On Sombor Index for Uniform Hypergraphs
Match Communications in Mathematical and in Computer ChemistrySummary: The Sombor index for graphs is given by \textit{I. Gutman} [MATCH Commun. Math. Comput. Chem. 86, No. 1, 11--16 (2021; Zbl 1474.92154)]. Since hypergraphs can more accurately describe certain chemical scenarios. Then it has been proposed to generalize the Sombor index from graphs to hypergraphs. Recently, \textit{S. S. Shetty} and \textit{K. A.
Li, Zhuanzhuan +4 more
openaire +1 more source
Clique-symmetric uniform hypergraphs
2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McSorley, John P, Porter, Thomas
openaire +1 more source
On the Sizes of k-edge-maximal r-uniform Hypergraphs
Acta Mathematicae Applicatae Sinica, 2022Hong-Jian Lai
exaly
On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree
Lecture Notes in Computer Science, 2023Zhongzheng Tang, Zhuo Diao
exaly
On Ramsey numbers of uniform hypergraphs with given maximum degree
Journal of Combinatorial Theory - Series A, 2006V Rödl, A V Kostochka
exaly

