Results 21 to 30 of about 4,061 (147)
Toric algebra of hypergraphs [PDF]
, 2013 The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs.
Petrović, Sonja, Stasi, Despina
core +1 more source
Color-blind index in graphs of very low degree [PDF]
, 2015 Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$.
Achlioptas +13 more
core +3 more sources
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms [PDF]
, 2019 A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes.
Guruswami, Venkatesan, Sandeep, Sai
core +1 more source
Colored complete hypergraphs containing no rainbow Berge triangles
Theory and Applications of Graphs, 2019 The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name GallaiRamsey numbers.
Colton Magnant
semanticscholar +1 more source
Covering complete partite hypergraphs by monochromatic components [PDF]
, 2016 A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core +2 more sources
Chromatic Ramsey number of acyclic hypergraphs [PDF]
, 2015 Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi(T,t)$ as the smallest $m$ with the following property: if the edges of any $m$-chromatic $r$-uniform hypergraph are colored with
Gyárfás, András +2 more
core +2 more sources
Distributed Symmetry Breaking in Hypergraphs
, 2014 Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs.
A. Ephremides +16 more
core +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
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
, 2017 We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds.
Fischer, Manuela +2 more
core +1 more source