The following pages link to Péter Komjáth (Q178041):
Displaying 50 items.
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three (Q1878591) (← links)
- Some remarks on the simultaneous chromatic number (Q1878592) (← links)
- Precalibre pairs of measure algebras (Q1886710) (← links)
- Universal graphs without large cliques (Q1892834) (← links)
- Uniform intersecting families with covering number four (Q1894015) (← links)
- On the average rank of LYM-sets (Q1898339) (← links)
- Producing new bijections from old (Q1901131) (← links)
- Defect Sauer results (Q1903004) (← links)
- The continuous Beck-Fiala theorem is optimal (Q1903712) (← links)
- Maximum trees of finite sequences (Q1904988) (← links)
- On \(r\)-cover-free families (Q1906129) (← links)
- On Taylor's problem (Q1912691) (← links)
- Atoms of set systems with a fixed number of pairwise unions (Q1916106) (← links)
- Extremal cases of the Ahlswede-Cai inequality (Q1924240) (← links)
- The complete nontrivial-intersection theorem for systems of finite sets (Q1924241) (← links)
- A short proof of a partion relation for triples (Q1977370) (← links)
- List coloring of random and pseudo-random graphs (Q1977428) (← links)
- Exact bounds for judicious partitions of graphs (Q1977429) (← links)
- List homomorphisms and circular arc graphs (Q1977431) (← links)
- Minimal covering sets for infinite set systems (Q1999754) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- The quasi order of graphs on an ordinal (Q2275378) (← links)
- The colouring number of infinite graphs (Q2300155) (← links)
- Universal graphs omitting finitely many finite graphs (Q2329180) (← links)
- A note on uncountable chordal graphs (Q2344784) (← links)
- An upper bound for van der Waerden-like numbers using \(k\) colors (Q2366957) (← links)
- The Turán number of the Fano plane (Q2368588) (← links)
- On a hypergraph Turán problem of Frankl (Q2368596) (← links)
- A note on Euclidean Ramsey theory (Q2385141) (← links)
- Well ordering groups with no monotone arithmetic progressions (Q2407684) (← links)
- Note on the point character of \(\ell_1\)-spaces (Q2448978) (← links)
- An infinite color analogue of Rado's theorem (Q2459498) (← links)
- Successors of singular cardinals and coloring theorems. I (Q2486986) (← links)
- Forcing and antifoundation (Q2486987) (← links)
- Problems and theorems in classical set theory (Q2494648) (← links)
- On shadows of intersecting families (Q2567401) (← links)
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares (Q2567403) (← links)
- Almost covers of 2-arc transitive graphs (Q2567405) (← links)
- Isomorphism classes of maximal intersecting uniform families are few (Q2583668) (← links)
- A problem of Laczkovich: how dense are set systems with no large independent sets? (Q2630826) (← links)
- A hierarchy of Ramsey cardinals (Q2639851) (← links)
- A polarized partition relation using elementary substructures (Q2710592) (← links)
- Translations on graphs (Q2714205) (← links)
- Investigating the connectivity of hypergraphs via their spectra (Q2714391) (← links)
- ECO-systems for Dyck and Schröder paths (Q2755037) (← links)
- About half the middle binomial coefficient (Q2755046) (← links)
- Coloring \({\mathbb R}^n\) (Q2759050) (← links)
- Testing graphs for colorability properties (Q2768393) (← links)
- A Ramsey-style extension of a theorem of Erdős and Hajnal (Q2773241) (← links)
- A combinatorial property of cardinals (Q2781310) (← links)
