Strong Taylor's conjecture on finite subgraphs of shift graphs
Statement
For a cardinal , the shift graph has as vertices the increasing -tuples of ordinals less than , with adjacency defined by the shift condition. A graph contains all finite subgraphs of another graph when every finite subgraph of the latter occurs as a subgraph of . Strong Taylor's conjecture. For any graph with there exists an such that contains all finite subgraphs of . The conjecture was proposed as a strengthening of Taylor's conjecture by Erdős–Hajnal–Shelah and Taylor, and the supplied text states that it was refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.