Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (Q4920648): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583237, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.21653 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132969890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs without forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typical structure of graphs without given excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all triple systems with independent neighborhoods are semi-bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadruple systems with independent neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triple Systems with Independent Neighbourhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-books of three pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triple Systems Not Containing a Fano Configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph Turán problem of Frankl / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of the Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and a 0-1 law for $m$-clique free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Colourings of Hypergraphs Without Monochromatic Fano Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural result for hypergraphs with many restricted edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hypergraph extension of Turán's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of Mantel's theorem to \(k\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of triple systems not containing a fixed one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879181 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:24, 6 July 2024

scientific article; zbMATH DE number 6164619
Language Label Description Also known as
English
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
scientific article; zbMATH DE number 6164619

    Statements

    Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs (English)
    0 references
    0 references
    0 references
    21 May 2013
    0 references
    extremal problems
    0 references
    Turán graph
    0 references

    Identifiers

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