The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220825836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Combinatorial Problem of Erdös and Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem of P. Erdős and L. Lovasz / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on random greedy coloring of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent random choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers in uniform intersecting families and a counterexample to a conjecture of Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invitation to intersection problems for finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of 3-chromatic hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem for arithmetic progressions of length four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Erdős and Lovász: Random lines in a projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Erdos and Lovasz. II: n(r) = O(r) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small Ramsey numbers* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy colorings of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in hypergraph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein kombinatorisches Problem von P. Erdős und A. Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few remarks on Ramsey--Turán-type problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:59, 2 August 2024

scientific article; zbMATH DE number 7740387
Language Label Description Also known as
English
The intersection spectrum of 3‐chromatic intersecting hypergraphs
scientific article; zbMATH DE number 7740387

    Statements

    The intersection spectrum of 3‐chromatic intersecting hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2023
    0 references
    Erdős-Lovász conjecture
    0 references
    Ramsey-type arguments
    0 references
    density increment approach
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references