Pages that link to "Item:Q1260043"
From MaRDI portal
The following pages link to A short proof of the existence of highly chromatic hypergraphs without short cycles (Q1260043):
Displayed 20 items.
- Sparse Ramsey graphs (Q795843) (← links)
- Combinatorial partitions of finite posets and lattices - Ramsey lattices (Q798338) (← links)
- A hypergraph-free construction of highly chromatic graphs without short cycles (Q915736) (← links)
- On graphs that can be oriented as diagrams of ordered sets (Q1061751) (← links)
- A non-covering graph of girth six (Q1106240) (← links)
- The partite construction and Ramsey set systems (Q1119640) (← links)
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (Q1167185) (← links)
- Chromatic number of Hasse diagrams, eyebrows and dimension (Q1182040) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- Graphs and digraphs with given girth and connectivity (Q1336679) (← links)
- Compactness and finite equivalence of infinite digraphs (Q1356449) (← links)
- A class of edge critical 4-chromatic graphs (Q1359372) (← links)
- Some theorems concerning the star chromatic number of a graph (Q1362095) (← links)
- The number of dependent arcs in an acyclic orientation (Q1386477) (← links)
- On sets of integers with the Schur property (Q1821785) (← links)
- High girth and extendability (Q1918540) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Chromatic capacity and graph operations (Q2483394) (← links)
- Independent Transversals in Sparse Partite Hypergraphs (Q4314148) (← links)
- (Q5708621) (← links)