Results 81 to 90 of about 1,354,678 (274)
Cycle Decompositions in 3-Uniform Hypergraphs
Combinatorica, 2023 We show that $3$-graphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing that our bounds are best possible up to the $o(1)$ term.
Piga, Simón +1 more
openaire +2 more sources
The Hardness of 3-Uniform Hypergraph Coloring
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002 We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors.
Irit Dinur +2 more
semanticscholar +1 more source
Saturated r-uniform hypergraphs
Discrete Mathematics, 1991 AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F ⊄ H but a subhypergraph isomorphic to F occurs whenever a new edge (r-tuple) is added to H.
Zoltán Füredi, Zsolt Tuza, Paul Erdős
openaire +1 more source
Advanced Quantum Technologies, EarlyView.The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini +2 more
wiley +1 more source
Randi´c Matrix and Randi´c Energy of Uniform Hypergraphs [PDF]
Mathematics Interdisciplinary ResearchThe Randi´c matrix $R=[r_{ij}]$ of a graph $ G=(V,E) $ was defined as $r_{ij}=\frac{1}{\sqrt{d_id_j}}$ if vertices $v_i$ and $v_j$ are adjacent and $r_{ij}=0$ otherwise, where $d_i$ is the degree of the vertex $v_i\in V$.
Gholam Hassan Shirdel +2 more
doaj +1 more source
On the Degree, Size, and Chromatic Index of a Uniform Hypergraph
Journal of Combinatorial Theory, 1997 Let H be ak-uniform hypergraph in which no two edges share more thantcommon vertices, and letDdenote the maximum degree of a vertex of H. We conjecture that for every?>0, ifDis sufficiently large as a function oft, k, and?, then the chromatic index of H ...
N. Alon, J. Kim
semanticscholar +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
State‐of‐the‐art Report in Sketch Processing
Computer Graphics Forum, EarlyView.Abstract Sketches are a powerful and natural form of communication and are used in numerous systems for modelling, animation, shape retrieval, and editing. Despite their popularity, rough sketches — whether raster or vector, 2D or 3D — are often too complex and imprecise to be used directly and thus need special processing.
Chenxi Liu, Mikhail Bessmeltsev
wiley +1 more source
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
, 2013 We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this code for ...
Guruswami, Venkatesan +4 more
core +1 more source
On the principal eigenvectors of uniform hypergraphs
Linear Algebra and its Applications, 2016 In this version, we corrected a reference for the fact Page 6 Line 1, which shoud be [15], not [5] as ...
Lele Liu, Liying Kang, Xiying Yuan
openaire +3 more sources