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):
Displaying 39 items.
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- Degrees in oriented hypergraphs and sparse Ramsey theory (Q458290) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- The fractional chromatic number of Zykov products of graphs (Q617003) (← links)
- On a construction of graphs with high chromatic capacity and large girth (Q708406) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- 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)
- Independent coverings and orthogonal colourings (Q2032848) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) (Q2326661) (← links)
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Constraints, MMSNP and expander relational structures (Q2439829) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Chromatic capacity and graph operations (Q2483394) (← links)
- Incidence posets and cover graphs (Q2510383) (← links)
- Distance Preserving Ramsey Graphs (Q2908128) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Attempting perfect hypergraphs (Q6076187) (← links)