Martin Klazar  Home/Search
Context
Related
| ms.mff.cuni.cz/acad/kam/klaz...expro.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kam.mff.cuni.cz/~k...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A hypergraph H = (H i : i 2 I) with the vertex set i2I H i = [n] = f1; 2; : : : ; ng contains another hypergraph H with the vertex set [m] (m n) if there is a subsequence 1 v 1 ! v 2 ! \Delta \Delta \Delta ! v m n of [n] and an injection f : I ! I such that, for every r 2 [m] and i 2 I , r 2 H i implies that v r 2 H f(i) . We investigate the extremal functions H e (F ; n) and H i (F ; n) defined as the maximum size e(H) = jHj = jIj, resp. weight i(H) = i2I jH i j,... (Update)
Active bibliography (related documents): More All
1.6: Extremal Problems for Ordered (Hyper)Graphs: Applications of.. - Klazar (2002) (Correct)
0.3: Durfee Polynomials - Canfield, Corteel, Savage (1998) (Correct)
0.2: On the Number of Prime Numbers less than a Given Quantity - Kolev (2000) (Correct)
Similar documents based on text: More All
0.2: Counting Pattern-free Set Partitions II: Noncrossing and Other.. - Klazar (2000) (Correct)
0.1: Generalized Davenport-Schinzel Sequences - Klazar, Valtr (1993) (Correct)
0.1: Linear versus Hereditary Discrepancy - Bohman, Holzman (2002) (Correct)
BibTeX entry: (Update)
@misc{ klazar-extremal,
author = "Martin Klazar",
title = "Extremal Problems (and a Bit of Enumeration) for Hypergraphs with Linearly
Ordered Vertex Sets",
url = "citeseer.ist.psu.edu/klazar01extremal.html" }
Citations (may not include all citations):214 Davenport--Schinzel Sequences and Their Geometric Applicatio.. - Sharir, Agarwal - 1995
157 Advanced Combinatorics (context) - Comtet - 1974
126 Combinatorial Problems and Exercises (context) - Lov'asz - 1993
92 Line Encyclopedia of Integer Sequences - Sloane, On- - 2000
75 Nonlinearity of Davenport--Schinzel sequences and of general.. (context) - Hart, Sharir - 1986
30 Modern Graph Theory (context) - Bollob'as - 1998
20 Graph theory and probability (context) - os - 1959
16 A general upper bound in extremal theory of sequences (context) - Klazar - 1992
11 Davenport--Schinzel theory of matrices (context) - uredi, Hajnal - 1992
7 The maximum number of unit distances in a convex n-gon (context) - uredi - 1990
6 Extremal set systems (context) - Frankl - 1995
5 Applications of the set-pair method in extremal hypergraph t.. (context) - Tuza - 1994
4 Analytic Number Theory (context) - Newman - 1998
3 an elementary proof of some asymptotic formulas in the theor.. (context) - os - 1942
2 Applications of the set-pair method in extremal problems (context) - Tuza - 1996
2 Counting pattern-free set partitions II (context) - Klazar - 2000
1 Minimal covers of finite sets (context) - Hearne, Wagner - 1973
1 Tur'an type problems (context) - uredi
1 Small forbidden configurations II - Anstee, Ferguson et al. - 2001
1 The maximum number of times the same distance can occur amon.. - Bra, Pach - 2001
1 Covers of a finite set (context) - Macula - 1994
1 The evaluation of the constant in the formula for the number.. (context) - Newman - 1951
1 A simplified proof of the partition formula (context) - Newman - 1962
1 J'anos Bolyai Mathematical Society (context) - Frank, uredi et al. - 1994
Documents on the same site (http://kam.mff.cuni.cz/~klazar/publications.html): More
Twelve Countings with Rooted Plane Trees - Klazar (1997) (Correct)
Extremal Problems for Colored Trees and Davenport-Schinzel.. - Klazar (1999) (Correct)
Counting pattern-free set partitions I: A generalization of.. - Klazar (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC