A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Our result is the first to show the NP-hardness of coloring a c-colorable k-uniform hypergraph with poly-logarithmically many colors, for any constants c ≥ 2 and k ≥ 3. ... We give very short and simple proofs of the following statements: Given a 2-colorable 4-uniform hypergraph on n vertices, 1. It is NP-hard to color it with log δ n colors for some δ > 0. 2. ... Can we go beyond poly(log n) coloring NP-hardness factor for coloring a c-colorable k-uniform hypergraph for some constants c ≥ 2 and k ≥ 3? ...doi:10.4230/lipics.icalp.2018.15 dblp:conf/icalp/Bhangale18 fatcat:mgbf47aqozgf5dbcg6a33wvnba
We prove almost tight hardness results under randomized reductions for finding independent sets in bounded degree graphs and hypergraphs that admit a good coloring. ... 1 r−1 in a 2-colorable r-uniform hypergraph for each fixed r 4. ... Acknowledgments We thank Rishi Saket for useful discussions and for pointing us to the reference  on the pairwise independent distribution of Theorem 5.1. ...doi:10.1137/1.9781611973082.125 dblp:conf/soda/GuruswamiS11 fatcat:gwwvoafbmvajreh6awqsoz7dva
Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-uniform hypergraphs on ... On the positive side, improving a result of Hofmeister and Lefmann, we present an approximation algorithm for coloring r-uniform hypergraphs on n vertices, whose performance ratio is O(n(log log n) 2 / ... Acknowledgments We thank Thomas Hofmeister for bringing paper  to our attention. ...doi:10.1016/s0196-6774(03)00077-4 fatcat:u5j6a2xjnralxixk73h7xypnqm
Lecture Notes in Computer Science
A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. ... We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. ... Morris Jr. for many helpful discussions regarding integer programming. ...doi:10.1007/978-3-540-31833-0_21 fatcat:wpgt4mjnfbaldfxx26dyyssyoe
To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. ... This is in sharp contrast to classical unicast Clos networks for which all the control problems are polynomially solvable. ... The authors wish to thank anonymous referees for their valuable comments. This article has been partially supported by National Science Centre under the grant DEC-2011/02/A/ST6/00201. ...doi:10.1515/bpasts-2015-0085 fatcat:eu2ff4oafjchllqcdgcukbycme
Our first result is an algorithm that colors any 2- colorable hypergraph with 7m vertices and dimension d using O(n'~'/4log'~'/4n) colors. ... Previously obtained results for simple hypergraphs and multihypergraphs di- rectly follow from Theorem | in the boundary cases r = | and r = ...
The techniques rely on new NP-completeness results for hypergraph colorings. ... Given a graph property P and positive integer k, a P k-coloring of a graph G is an assignment of one of k colors to each vertex of the graph so that the subgraphs induced by each color class have property ... The author wishes to thank Derek Comeil for his insightful comments and suggestions. ...doi:10.1016/0166-218x(96)00096-0 fatcat:rcb3l3banjgmhdbrgtd3nkc2ya
For a general hypergraph, the determination of packing and covering parame- ters is NP-hard. ... The second section, “Hypergraphs versus graphs”, focuses on results that extend graph theory. These results include some gen- eralizations about cycles and hypergraph minors. ...
In this work, we provide such a characterization for the case of bounded in-degree graphs, thereby resolving the gap between existing hardness and tractability results. ... We show that the tractable classes of bounded-arity colored hypergraphical games are precisely those whose reduced graphs have bounded treewidth modulo homomorphic equivalence. ... On the other hand, our proof for our hardness result is quite unlike the existing NP-hardness proof for graphical games  . ...arXiv:1002.1363v1 fatcat:5mg2u3eq6za4hgxtejrcqt4jmm
This fact has several interesting corollaries, e.g., that deciding whether a feasible set of a mixed hypergraph is gap-free is both NP-hard and coNP-hard. ... We further prove that for any fixed finite sets of positive integers $A_1\subset A_2$ ($1\notin A_2$), it is NP-hard to decide whether the feasible set of a given mixed hypergraph is equal to $A_2$ even ... of this paper and the anonymous referee for helpful comments on the presentation of the results and pointing out several related references. ...doi:10.37236/1772 fatcat:gavkaumebrbrzdyx6wu5xsw4fi
We then show examples of applying the results to new problems and indicate the way to algorithms and refined complexity results for all these examples at the same time. ... A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number ... Conclusion: We tried to show by the Theorem and multiple examples how results on graph colorings may be extended to covers in hypergraphs. ...arXiv:1910.11302v1 fatcat:zjv764nrmvexhhtzdcxv7usr2m
Lecture Notes in Computer Science
Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-uniform hypergraphs on ... We also describe an algorithm for coloring 3-uniform 2-colorable hypergraphs on n vertices inÕ(n 9=41 ) colors, thus improving previous results of Chen and Frieze and of Kelsen, Mahajan and Ramesh. ... At this point we can use the fact that the graph formed by edges of size two is also 2-colorable and therefore we need at most two new colors for each color class in the coloring of the 3-uniform hypergraph ...doi:10.1007/3-540-68530-8_40 fatcat:qy3kpwszg5hcvaphb4emftewfm
We will propose two relaxations based on Semi-Definite Programming models for graph and hypergraph coloring, to approximate those (generally) NP-hard problems, as well as a generalization of the works ... of Karger et al. for hypergraph coloring, to find good feasible solutions with a probabilistic approach. ... We can obtain non-approximability results for K n -Coloring by combining this transformation with hardness of approximation results for Coloring, such as the result of Lund et al. ...doi:10.1051/ro:2001112 fatcat:whc6ezuvt5hohhzawy6evz2dxq
hypergraphs G with ν(G) ≤ s; Maximum Weight Stable Set in k-uniform hypergraphs with ν(G) ≤ s; as well as partial results for r-Coloring in k-uniform hypergraphs ν(G) ≤ s. ... 3-coloring linear 3-uniform hypergraphs G with ν(G) ≤ 532 is NP-hard. ... The hypergraph coloring problem is a natural extension of the graph coloring problem; see the survey  . The following result shows that the problem is NP-hard, even in uniform hypergraphs. ...arXiv:2111.10393v2 fatcat:r2uwtg66w5e3letzjus2omrqzy
They also study operations that preserve unique colorability and show that recognition of uc mixed hypergraphs is NP-hard. Douglas B. ... A short proof is given for a result of P. M. Gibson [Proc. Amer. Math. ...
« Previous Showing results 1 — 15 out of 3,642 results