A universal partition result for infinite homogeneous -free and related graphs
- 30 September 2020
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (1) , 112153
Abstract
No abstract availableKeywords
Funding Information
- Austrian Science Fund
- Natural Sciences and Engineering Research Council of Canada
- European Research Council
- Pacific Institute for the Mathematical Sciences
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
This publication has 12 references indexed in Scilit:
- Balanced independent sets in graphs omitting large cliquesJournal of Combinatorial Theory, Series B, 2019
- On Forming CommitteesThe American Mathematical Monthly, 2011
- Odd Independent Transversals are OddCombinatorics, Probability and Computing, 2006
- Sets of vectors with many orthogonal paris:Graphs and Combinatorics, 1992
- The indivisibility of the homogeneous Kn-free graphsJournal of Combinatorial Theory, Series B, 1989
- Coloring of universal graphsGraphs and Combinatorics, 1986
- Countable homogeneous relational structures and ℵ0-categorical theoriesThe Journal of Symbolic Logic, 1972
- A family of countable homogeneous graphsPacific Journal of Mathematics, 1971
- Proof of a conjecture of B. RuziewiczFundamenta Mathematicae, 1961
- Partially Ordered SetsAmerican Journal of Mathematics, 1941