Lower Bounds for the Graph Homomorphism Problem

@article{Fomin2015LowerBF,
  title={Lower Bounds for the Graph Homomorphism Problem},
  author={Fedor V. Fomin and Alexander Golovnev and Alexander S. Kulikov and Ivan Mihajlin},
  journal={ArXiv},
  year={2015},
  volume={abs/1502.05447}
}
  • Fedor V. Fomin, Alexander Golovnev, +1 author Ivan Mihajlin
  • Published in ICALP 2015
  • Mathematics, Computer Science
  • ArXiv
  • The graph homomorphism problem (HOM) asks whether the vertices of a given n-vertex graph G can be mapped to the vertices of a given h-vertex graph H such that each edge of G is mapped to an edge of H. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the 2-CSP problem. In this paper, we prove several lower bounds for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound \(2^{\Omega \left( \frac{n… CONTINUE READING
    2
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES

    Large Networks and Graph Limits

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Set Partitioning via Inclusion-Exclusion

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Nešetřil. Graphs and homomorphisms, volume 28 of Oxford Lecture Series in Mathematics and its Applications

    • Pavol Hell, Jaroslav
    • 2004
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Locally constrained graph homomorphisms - structure, complexity, and applications

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Fomin , Lukasz Kowalik , Daniel Lokshtanov , Daniel Marx , Marcin Pilipczuk , Michal Pilipczuk , and Saket Saurabh

    • Marek Cygan, V Fedor
    • Parameterized Algorithms
    • 2015

    Fomin , Lukasz Kowalik , Daniel Lokshtanov , Daniel Marx , Marcin Pilipczuk , Michal Pilipczuk , and Saket Saurabh

    • Marek Cygan, V Fedor
    • Parameterized Algorithms
    • 2015

    Exact algorithm for graph homomorphism and locally injective graph homomorphism

    VIEW 2 EXCERPTS

    Lower bounds based on the Exponential Time Hypothesis

    VIEW 1 EXCERPT