Pages that link to "Item:Q690671"
From MaRDI portal
The following pages link to The de Bruijn-Erdős theorem for hypergraphs (Q690671):
Displaying 12 items.
- De Bruijn-Erdős-type theorems for graphs and posets (Q512579) (← links)
- The combinatorics of Dom de Caen (Q1766102) (← links)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts (Q2323815) (← links)
- Correction to: ``A de Bruijn-Erdős theorem in graphs?'' (Q2417490) (← links)
- Lines in hypergraphs (Q2439836) (← links)
- Characterizing cliques in hypergraphs (Q4194960) (← links)
- Some remarks on the Zarankiewicz problem (Q5081317) (← links)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
- Exact values for some unbalanced Zarankiewicz numbers (Q6201027) (← links)
- Zarankiewicz numbers near the triple system threshold (Q6584901) (← links)
- Extremal graphs without exponentially small bicliques (Q6610106) (← links)