Journal article
Counting homomorphisms to K4-minor-free graphs, modulo 2
- Abstract:
-
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [Theory Comput., 11 (2015), pp. 35--57] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the problem is solvable in polynomial time and, otherwise, the problem is complete for the complexity class $\oplus{P}$ of parity problems. We verify their conjecture for all graphs $H$ that exclude the complete graph on four vertic...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, 440.2KB)
-
- Publisher copy:
- 10.1137/20M1382921
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Society for Industrial and Applied Mathematics Publisher's website
- Journal:
- SIAM Journal on Discrete Mathematics Journal website
- Volume:
- 35
- Issue:
- 4
- Pages:
- 2749–2814
- Publication date:
- 2021-11-18
- Acceptance date:
- 2021-07-26
- DOI:
- EISSN:
-
1095-7146
- ISSN:
-
0895-4801
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
1187641
- Local pid:
- pubs:1187641
- Deposit date:
- 2021-07-27
Terms of use
- Copyright holder:
- Society for Industrial and Applied Mathematics
- Copyright date:
- 2021
- Rights statement:
- © 2021, Society for Industrial and Applied Mathematics
If you are the owner of this record, you can report an update to it here: Report update to this record