Results 21 to 30 of about 4,016 (110)
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
The dynamics of criminal collaboration: Multiplex ties in mafia networks
Criminology, EarlyView.Abstract This study examines how social embeddedness and multiplex relationships shape criminal collaboration within organized crime networks. Drawing on data from three major investigations into the ‘Ndrangheta, we analyze how kinship, clan affiliation, leadership, and prior interactions influence participation in meetings and phone calls.
Francesco Calderoni +2 more
wiley +1 more source
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
Total weight choosability in Hypergraphs [PDF]
, 2013 A total weighting of the vertices and edges of a hypergraph is called vertex-coloring if the total weights of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this note
Pfender, Florian
core
A Vulnerability Lens for Intuitive‐Logic Scenarios
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
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
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.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
Ramsey numbers of ordered graphs
, 2019 An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N ...
Balko, Martin +3 more
core +1 more source
Hypergraphs with arbitrarily small codegree Turán density
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence [PDF]
, 2010 We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area.
Barenboim, Leonid, Elkin, Michael
core