- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Forbidden subgraphs and forbidden substructures
Journal of Symbolic Logic 66 (3):1342-1352 (2001)
Abstract
The problem of the existence of a universal structure omitting a finite set of forbidden substructures is reducible to the corresponding problem in the category of graphs with a vertex coloring by two colors. It is not known whether this problem reduces further to the category of ordinary graphs. It is also not known whether these problems are decidableOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Forbidden Induced Subgraphs and the Łoś–Tarski Theorem.Yijia Chen & Jörg Flum - 2024 - Journal of Symbolic Logic 89 (2):516-548.
The Ramsey theory of the universal homogeneous triangle-free graph.Natasha Dobrinen - 2020 - Journal of Mathematical Logic 20 (2):2050012.
Finitely constrained classes of homogeneous directed graphs.Brenda J. Latka - 1994 - Journal of Symbolic Logic 59 (1):124-139.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Forbidden subgraphs in terms of forbidden quantifiers.T. A. McKee - 1978 - Notre Dame Journal of Formal Logic 19 (1):186-188.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.
The existence of a near-unanimity term in a finite algebra is decidable.Miklós Maróti - 2009 - Journal of Symbolic Logic 74 (3):1001-1014.
Analytics
Added to PP
2009-01-28
Downloads
234 (#109,445)
6 months
10 (#367,827)
2009-01-28
Downloads
234 (#109,445)
6 months
10 (#367,827)
Historical graph of downloads
Citations of this work
Ramsey Theory for Countable Binary Homogeneous Structures.Jean A. Larson - 2005 - Notre Dame Journal of Formal Logic 46 (3):335-352.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7f8ff5d46-xvd4d uwo