The following pages link to (Q4326643):
Displayed 14 items.
- Clique versus independent set (Q402465) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- Some colouring problems for Paley graphs (Q817760) (← links)
- On the relations of various conjectures on Latin squares and straightening coefficients (Q1322185) (← links)
- On even and odd latin squares (Q1344239) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- On partitioning two matroids into common independent subsets (Q2570121) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- (Q4691855) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)