Results 31 to 40 of about 1,639 (93)
A removal lemma for ordered hypergraphs
Proceedings of the London Mathematical Society, Volume 130, Issue 1, January 2025.Abstract We prove a removal lemma for induced ordered hypergraphs, simultaneously generalizing Alon–Ben‐Eliezer–Fischer's removal lemma for ordered graphs and the induced hypergraph removal lemma. That is, we show that if an ordered hypergraph (V,G,<)$(V,G,<)$ has few induced copies of a small ordered hypergraph (W,H,≺)$(W,H,\prec)$ then there is a ...
Henry Towsner
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
Homomorphisms and Embeddings of STRIPS Planning Models
Computational Intelligence, Volume 40, Issue 6, December 2024.ABSTRACT Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance P$$ P $$ and a sub‐instance of another instance P′$$ {P}^{\prime } $$. One application of such a mapping is
Arnaud Lequen +2 more
wiley +1 more source
, 2017 The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of vertices have ...
Manurangsi, Pasin
core +2 more sources
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs
Random Structures &Algorithms, Volume 65, Issue 2, Page 313-341, September 2024.Abstract A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac's theorem in mind, it is natural to ask what minimum d$$ d $$‐degree condition guarantees the existence of a loose Hamilton cycle in a k$$ k $$‐uniform ...
Kalina Petrova, Miloš Trujić
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
Inverse Fuzzy‐Directed Graph With an Application in Traffic Flow Problem
Journal of Mathematics, Volume 2024, Issue 1, 2024.The fuzzy‐directed graph is an efficient tool to deal with the directional relationships among the nodes that possess imprecise and uncertain information. To handle the membership value of the edges that provide greater effect when two nodes are combined, we introduce inverse fuzzy‐directed graph (IFDG) GDI.
R. Keerthana +4 more
wiley +1 more source
The Ising Partition Function: Zeros and Deterministic Approximation
, 2018 We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs that is valid
Liu, Jingcheng +2 more
core +1 more source
$L_p$ regular sparse hypergraphs
, 2018 We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as $L_p$ regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a question of Borgs,
Dodos, Pandelis +2 more
core +1 more source
Shortened Array Codes of Large Girth
, 2006 One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in short cycles. This
Kashyap, Navin +2 more
core +2 more sources