Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
Work
Year: 2019
Type: article
Abstract: For $n\geq 3$, let $(H_n, E)$ denote the $n$th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on ... more
Source: SIAM Journal on Computing
Institutions Charles University, Durham University, TU Dresden, TU Wien
Cites: 24
Cited by: 31
Related to: 10
FWCI: 5.926
Citation percentile (by year/subfield): 92.64
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green