Pages that link to "Item:Q5112450"
From MaRDI portal
The following pages link to Extremal problems in hypergraph colourings (Q5112450):
Displaying 18 items.
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
- On Some Extremal Properties of Hypergraph Colorings (Q3503457) (← links)
- (Q4347903) (← links)
- (Q4726273) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs (Q6546362) (← links)
- The intersection spectrum of 3-chromatic intersecting hypergraphs (Q6604685) (← links)
