Pages that link to "Item:Q5112450"

The following pages link to Extremal problems in hypergraph colourings (Q5112450):

Displaying 11 items.

• 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)
• The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
• Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)